{"as_of":"2026-07-18T04:29:00Z","canonical_paper_id":"1107.2171","canonical_url":"https://pith.science/paper/1107.2171/integrity","context_digest":"sha256:a9df0b116f8bc01b9563daaa8eb47f5ad08852fad996923cd721a47034d61e76","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/1107.2171","bundle_json":"/pith/VVCC6GZTF6IVEDLZZ2GLXT6ONI/bundle.json","citation_record":"/paper/1107.2171/citation-record","evidence":"/evidence","html":"/paper/1107.2171/integrity","integrity_json":"/paper/1107.2171/integrity.json","json":"/paper/1107.2171/integrity.json","legacy_integrity_json":"/pith/1107.2171/integrity.json","paper":"/paper/1107.2171","reference_changes":"/flags?citing=1107.2171"},"paper":{"arxiv_id":"1107.2171","latest_version":1,"primary_cat":"math.CO","title":"Reverse degree distance of unicyclic graphs"},"pith_number":"pith:2011:VVCC6GZTF6IVEDLZZ2GLXT6ONI","pith_short":"VVCC6GZTF6IVEDLZZ2GLXT6ONI","record":{"arxiv_id":"1107.2171","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1107.2171. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}