{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NXIUCNVIMZ2KR4TLPWGJXTHLW2","short_pith_number":"pith:NXIUCNVI","canonical_record":{"source":{"id":"2508.01349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-02T12:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"d3ce80e415edf43b2309f228714d748b130ba5469d23216c3e9a7529da52a758","abstract_canon_sha256":"0723162471a293b7e60d9d0c4206d86a2c838fb45af250d7f4a691c2966815d9"},"schema_version":"1.0"},"canonical_sha256":"6dd14136a86674a8f26b7d8c9bccebb6b3560599fe6105557551228db22096b8","source":{"kind":"arxiv","id":"2508.01349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.01349","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"2508.01349v1","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01349","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"NXIUCNVIMZ2K","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"pith_short_16","alias_value":"NXIUCNVIMZ2KR4TL","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"pith_short_8","alias_value":"NXIUCNVI","created_at":"2026-07-05T11:47:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NXIUCNVIMZ2KR4TLPWGJXTHLW2","target":"record","payload":{"canonical_record":{"source":{"id":"2508.01349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-02T12:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"d3ce80e415edf43b2309f228714d748b130ba5469d23216c3e9a7529da52a758","abstract_canon_sha256":"0723162471a293b7e60d9d0c4206d86a2c838fb45af250d7f4a691c2966815d9"},"schema_version":"1.0"},"canonical_sha256":"6dd14136a86674a8f26b7d8c9bccebb6b3560599fe6105557551228db22096b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:37.652027Z","signature_b64":"k7D1Lax8TGJGwM2UwjIg5GjgnYZTGrphVE9s58A4KKd0LXKuzeRobLovIMlL+uwrsXum/g8bSI4Cc+szXJ+YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dd14136a86674a8f26b7d8c9bccebb6b3560599fe6105557551228db22096b8","last_reissued_at":"2026-07-05T11:47:37.651448Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:37.651448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.01349","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vk2JTPu3JUhEaG3diK6kLEgV1BjvGH39RKZZsRAVUocRsKXxF3UXg3jf+l1ZEx2qeKFIYSGxzT/PvamspRcnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:31:19.517088Z"},"content_sha256":"fea67c350732d3b274962155910bad8f0538d54d05c929dc34d57c552c2897bc","schema_version":"1.0","event_id":"sha256:fea67c350732d3b274962155910bad8f0538d54d05c929dc34d57c552c2897bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NXIUCNVIMZ2KR4TLPWGJXTHLW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification of polyhedral graphs by numbers of common neighbours","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Riccardo W. Maffucci","submitted_at":"2025-08-02T12:54:59Z","abstract_excerpt":"We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices.\n  For every (finite) set of non-negative integers, we either classify all the polyhedra of that type, or construct infinitely many polyhedra of that type, or prove that none exist.\n  This problem is related to the theory of strongly regular and Deza graphs, distances in graphs, and degree sequences. There is potential for application to complex networks and data science."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01349","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/2508.01349/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JoQTuHikGZ5QKeDY/9aGqgG5i0fevo/ULTmWJqu9ZxKmYAFhxnWhRcsZgK43jW93jhyY5kh7cudia287jrX0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:31:19.517704Z"},"content_sha256":"dacf19bb0dbcbaa8f641c78f668b3368bc4ec1421a6d0cff46ae97081f62474d","schema_version":"1.0","event_id":"sha256:dacf19bb0dbcbaa8f641c78f668b3368bc4ec1421a6d0cff46ae97081f62474d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXIUCNVIMZ2KR4TLPWGJXTHLW2/bundle.json","state_url":"https://pith.science/pith/NXIUCNVIMZ2KR4TLPWGJXTHLW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXIUCNVIMZ2KR4TLPWGJXTHLW2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T16:31:19Z","links":{"resolver":"https://pith.science/pith/NXIUCNVIMZ2KR4TLPWGJXTHLW2","bundle":"https://pith.science/pith/NXIUCNVIMZ2KR4TLPWGJXTHLW2/bundle.json","state":"https://pith.science/pith/NXIUCNVIMZ2KR4TLPWGJXTHLW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXIUCNVIMZ2KR4TLPWGJXTHLW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NXIUCNVIMZ2KR4TLPWGJXTHLW2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0723162471a293b7e60d9d0c4206d86a2c838fb45af250d7f4a691c2966815d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-02T12:54:59Z","title_canon_sha256":"d3ce80e415edf43b2309f228714d748b130ba5469d23216c3e9a7529da52a758"},"schema_version":"1.0","source":{"id":"2508.01349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.01349","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"2508.01349v1","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01349","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"NXIUCNVIMZ2K","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"pith_short_16","alias_value":"NXIUCNVIMZ2KR4TL","created_at":"2026-07-05T11:47:37Z"},{"alias_kind":"pith_short_8","alias_value":"NXIUCNVI","created_at":"2026-07-05T11:47:37Z"}],"graph_snapshots":[{"event_id":"sha256:dacf19bb0dbcbaa8f641c78f668b3368bc4ec1421a6d0cff46ae97081f62474d","target":"graph","created_at":"2026-07-05T11:47:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.01349/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices.\n  For every (finite) set of non-negative integers, we either classify all the polyhedra of that type, or construct infinitely many polyhedra of that type, or prove that none exist.\n  This problem is related to the theory of strongly regular and Deza graphs, distances in graphs, and degree sequences. There is potential for application to complex networks and data science.","authors_text":"Riccardo W. Maffucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01349","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fea67c350732d3b274962155910bad8f0538d54d05c929dc34d57c552c2897bc","target":"record","created_at":"2026-07-05T11:47:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0723162471a293b7e60d9d0c4206d86a2c838fb45af250d7f4a691c2966815d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-02T12:54:59Z","title_canon_sha256":"d3ce80e415edf43b2309f228714d748b130ba5469d23216c3e9a7529da52a758"},"schema_version":"1.0","source":{"id":"2508.01349","kind":"arxiv","version":1}},"canonical_sha256":"6dd14136a86674a8f26b7d8c9bccebb6b3560599fe6105557551228db22096b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dd14136a86674a8f26b7d8c9bccebb6b3560599fe6105557551228db22096b8","first_computed_at":"2026-07-05T11:47:37.651448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:47:37.651448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k7D1Lax8TGJGwM2UwjIg5GjgnYZTGrphVE9s58A4KKd0LXKuzeRobLovIMlL+uwrsXum/g8bSI4Cc+szXJ+YAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:47:37.652027Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.01349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fea67c350732d3b274962155910bad8f0538d54d05c929dc34d57c552c2897bc","sha256:dacf19bb0dbcbaa8f641c78f668b3368bc4ec1421a6d0cff46ae97081f62474d"],"state_sha256":"cd4b22927c171c219018b735a674b310ca54db5278613da3dd646766ff536f24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNwPtHKVA9xKPhdEG/H9o+RcLavwaSFZBCz45LtmR+Y1xaXWh/F1ft2Nb+9HL0Ncn0tu/boZr7BVYO5CPj3SAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T16:31:19.530049Z","bundle_sha256":"a9e929b7a68bbe26d6766334c449d43d83a0b26362707bd16315cade2de073c1"}}