{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G5XWRJKSB476QIGEREN4E73PRD","short_pith_number":"pith:G5XWRJKS","schema_version":"1.0","canonical_sha256":"376f68a5520f3fe820c4891bc27f6f88d7c9dff1f60138963f451d116666c5e1","source":{"kind":"arxiv","id":"1608.00079","version":1},"attestation_state":"computed","paper":{"title":"A note on nearly platonic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dalibor Froncek, Donald L. Kreher, William J. Keith","submitted_at":"2016-07-30T06:29:55Z","abstract_excerpt":"A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to have exactly one disparate face, and offer some conjectures, including the conjecture that graphs with two disparate faces come in a small set of families."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1608.00079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-30T06:29:55Z","cross_cats_sorted":[],"title_canon_sha256":"7e235f6a4915eb65b98a21bb45074d452831dc0646761ab67ec3fd2e5924d24a","abstract_canon_sha256":"aabc2af187c589414acf6037874d539100ec08592dff9162cea6a41754108a83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:13.883172Z","signature_b64":"XFDG0zLYYL/Hhpu27InaXhW4CF/vm0n5mgSwp4TBnQslfS200jcvEKh+wGCV+TB1+rgaUi5pOZukTBpieNodCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"376f68a5520f3fe820c4891bc27f6f88d7c9dff1f60138963f451d116666c5e1","last_reissued_at":"2026-05-18T01:10:13.882485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:13.882485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on nearly platonic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dalibor Froncek, Donald L. Kreher, William J. Keith","submitted_at":"2016-07-30T06:29:55Z","abstract_excerpt":"A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to have exactly one disparate face, and offer some conjectures, including the conjecture that graphs with two disparate faces come in a small set of families."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00079","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.00079","created_at":"2026-05-18T01:10:13.882592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00079v1","created_at":"2026-05-18T01:10:13.882592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00079","created_at":"2026-05-18T01:10:13.882592+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5XWRJKSB476","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5XWRJKSB476QIGE","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5XWRJKS","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD","json":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD.json","graph_json":"https://pith.science/api/pith-number/G5XWRJKSB476QIGEREN4E73PRD/graph.json","events_json":"https://pith.science/api/pith-number/G5XWRJKSB476QIGEREN4E73PRD/events.json","paper":"https://pith.science/paper/G5XWRJKS"},"agent_actions":{"view_html":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD","download_json":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD.json","view_paper":"https://pith.science/paper/G5XWRJKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00079&json=true","fetch_graph":"https://pith.science/api/pith-number/G5XWRJKSB476QIGEREN4E73PRD/graph.json","fetch_events":"https://pith.science/api/pith-number/G5XWRJKSB476QIGEREN4E73PRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD/action/storage_attestation","attest_author":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD/action/author_attestation","sign_citation":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD/action/citation_signature","submit_replication":"https://pith.science/pith/G5XWRJKSB476QIGEREN4E73PRD/action/replication_record"}},"created_at":"2026-05-18T01:10:13.882592+00:00","updated_at":"2026-05-18T01:10:13.882592+00:00"}