{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YG5JM7JK3QYVH5HT3BYJB7KZAN","short_pith_number":"pith:YG5JM7JK","schema_version":"1.0","canonical_sha256":"c1ba967d2adc3153f4f3d87090fd590354ff7f72ddae11f9e96256f0ac3d5a4a","source":{"kind":"arxiv","id":"2605.16224","version":1},"attestation_state":"computed","paper":{"title":"The Facial Common Neighbourhood Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Riccardo W. Maffucci","submitted_at":"2026-05-15T17:35:45Z","abstract_excerpt":"Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their adjacency. We then prove that for all other polyhedra, con($G$) is non-planar.\n  We introduce a novel concept for polyhedra (and more generally, for plane graphs) $G$, namely the `facial common neighbourhood graph' facecon($G$). Its definition takes into account pairs of vertices with a common neighbour on the same face of $G$. It is a spanning subgraph of c"},"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":"2605.16224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T17:35:45Z","cross_cats_sorted":[],"title_canon_sha256":"d6229366090147172ead43c44f7ab73f86eaee14861b19da299f5135b2fa307f","abstract_canon_sha256":"19929ed36bb00d4ab0319be2e4e9fc49b098e567c9cd184031a213ecba28d34f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:58.904213Z","signature_b64":"focFug5oAoxHNy3XzzUm7HAN2WIZse5TlnOGhwER09NHE6DVJCtFfqUbEu8J3CQ0wr2R+VKdCM1An03FQ4FSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1ba967d2adc3153f4f3d87090fd590354ff7f72ddae11f9e96256f0ac3d5a4a","last_reissued_at":"2026-05-20T00:01:58.903456Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:58.903456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Facial Common Neighbourhood Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Riccardo W. Maffucci","submitted_at":"2026-05-15T17:35:45Z","abstract_excerpt":"Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their adjacency. We then prove that for all other polyhedra, con($G$) is non-planar.\n  We introduce a novel concept for polyhedra (and more generally, for plane graphs) $G$, namely the `facial common neighbourhood graph' facecon($G$). Its definition takes into account pairs of vertices with a common neighbour on the same face of $G$. It is a spanning subgraph of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16224","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16224/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"shingle_duplication","ran_at":"2026-05-19T17:49:43.974414Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T17:49:43.634146Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:24.340123Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T17:31:31.116127Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T17:22:05.400556Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.380095Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"621c5184c69f96c103f4cb0d271452292e60b868fd67bfb29614fc4b7c51b100"},"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":"2605.16224","created_at":"2026-05-20T00:01:58.903576+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16224v1","created_at":"2026-05-20T00:01:58.903576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16224","created_at":"2026-05-20T00:01:58.903576+00:00"},{"alias_kind":"pith_short_12","alias_value":"YG5JM7JK3QYV","created_at":"2026-05-20T00:01:58.903576+00:00"},{"alias_kind":"pith_short_16","alias_value":"YG5JM7JK3QYVH5HT","created_at":"2026-05-20T00:01:58.903576+00:00"},{"alias_kind":"pith_short_8","alias_value":"YG5JM7JK","created_at":"2026-05-20T00:01:58.903576+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/YG5JM7JK3QYVH5HT3BYJB7KZAN","json":"https://pith.science/pith/YG5JM7JK3QYVH5HT3BYJB7KZAN.json","graph_json":"https://pith.science/api/pith-number/YG5JM7JK3QYVH5HT3BYJB7KZAN/graph.json","events_json":"https://pith.science/api/pith-number/YG5JM7JK3QYVH5HT3BYJB7KZAN/events.json","paper":"https://pith.science/paper/YG5JM7JK"},"agent_actions":{"view_html":"https://pith.science/pith/YG5JM7JK3QYVH5HT3BYJB7KZAN","download_json":"https://pith.science/pith/YG5JM7JK3QYVH5HT3BYJB7KZAN.json","view_paper":"https://pith.science/paper/YG5JM7JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16224&json=true","fetch_graph":"https://pith.science/api/pith-number/YG5JM7JK3QYVH5HT3BYJB7KZAN/graph.json","fetch_events":"https://pith.science/api/pith-number/YG5JM7JK3QYVH5HT3BYJB7KZAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YG5JM7JK3QYVH5HT3BYJB7KZAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YG5JM7JK3QYVH5HT3BYJB7KZAN/action/storage_attestation","attest_author":"https://pith.science/pith/YG5JM7JK3QYVH5HT3BYJB7KZAN/action/author_attestation","sign_citation":"https://pith.science/pith/YG5JM7JK3QYVH5HT3BYJB7KZAN/action/citation_signature","submit_replication":"https://pith.science/pith/YG5JM7JK3QYVH5HT3BYJB7KZAN/action/replication_record"}},"created_at":"2026-05-20T00:01:58.903576+00:00","updated_at":"2026-05-20T00:01:58.903576+00:00"}