{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:34ZWMVFTURVYMHAT4DZBP2O2PG","short_pith_number":"pith:34ZWMVFT","schema_version":"1.0","canonical_sha256":"df336654b3a46b861c13e0f217e9da79b8954cfd620261426ee6a469855cca0a","source":{"kind":"arxiv","id":"2607.26842","version":1},"attestation_state":"computed","paper":{"title":"Automorphism Groups in Extremal Families of Polyhedral Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bobby Miraftab, Riccardo W. Maffucci","submitted_at":"2026-07-29T12:30:26Z","abstract_excerpt":"We study automorphism groups in five extremal families of polyhedral graphs. For every $n\\ge14$, we prove that every minimum-order $3$-polytopal graph containing a vertex of each degree $3,4,\\ldots,n$ is asymmetric. The proof uses an exact planar defect decomposition, a complete description of the high-degree tail, and a saturation theorem for the subgraph induced by the uniquely high-degree vertices. Duality gives the corresponding asymmetry result for minimum-face polyhedra containing faces of every size $3,4,\\ldots,n$. For the three polyhedral graphs whose complements are also polyhedral, w"},"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":"2607.26842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T12:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"33927072bf6b4e4a772a2ade03119dcbb5c2d04b3abbae2af8e0794d95e2bb94","abstract_canon_sha256":"fc3d99ce0ac991cf9f8e901ef3ea8014de2465080512ea867bad13788f8a4abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df336654b3a46b861c13e0f217e9da79b8954cfd620261426ee6a469855cca0a","last_reissued_at":"2026-07-30T01:22:30.496048Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:22:30.496048Z"},"graph_snapshot":{"paper":{"title":"Automorphism Groups in Extremal Families of Polyhedral Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bobby Miraftab, Riccardo W. Maffucci","submitted_at":"2026-07-29T12:30:26Z","abstract_excerpt":"We study automorphism groups in five extremal families of polyhedral graphs. For every $n\\ge14$, we prove that every minimum-order $3$-polytopal graph containing a vertex of each degree $3,4,\\ldots,n$ is asymmetric. The proof uses an exact planar defect decomposition, a complete description of the high-degree tail, and a saturation theorem for the subgraph induced by the uniquely high-degree vertices. Duality gives the corresponding asymmetry result for minimum-face polyhedra containing faces of every size $3,4,\\ldots,n$. For the three polyhedral graphs whose complements are also polyhedral, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26842","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/2607.26842/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.26842","created_at":"2026-07-30T01:22:30.501092+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26842v1","created_at":"2026-07-30T01:22:30.501092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26842","created_at":"2026-07-30T01:22:30.501092+00:00"},{"alias_kind":"pith_short_12","alias_value":"34ZWMVFTURVY","created_at":"2026-07-30T01:22:30.501092+00:00"},{"alias_kind":"pith_short_16","alias_value":"34ZWMVFTURVYMHAT","created_at":"2026-07-30T01:22:30.501092+00:00"},{"alias_kind":"pith_short_8","alias_value":"34ZWMVFT","created_at":"2026-07-30T01:22:30.501092+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/34ZWMVFTURVYMHAT4DZBP2O2PG","json":"https://pith.science/pith/34ZWMVFTURVYMHAT4DZBP2O2PG.json","graph_json":"https://pith.science/api/pith-number/34ZWMVFTURVYMHAT4DZBP2O2PG/graph.json","events_json":"https://pith.science/api/pith-number/34ZWMVFTURVYMHAT4DZBP2O2PG/events.json","paper":"https://pith.science/paper/34ZWMVFT"},"agent_actions":{"view_html":"https://pith.science/pith/34ZWMVFTURVYMHAT4DZBP2O2PG","download_json":"https://pith.science/pith/34ZWMVFTURVYMHAT4DZBP2O2PG.json","view_paper":"https://pith.science/paper/34ZWMVFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26842&json=true","fetch_graph":"https://pith.science/api/pith-number/34ZWMVFTURVYMHAT4DZBP2O2PG/graph.json","fetch_events":"https://pith.science/api/pith-number/34ZWMVFTURVYMHAT4DZBP2O2PG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34ZWMVFTURVYMHAT4DZBP2O2PG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34ZWMVFTURVYMHAT4DZBP2O2PG/action/storage_attestation","attest_author":"https://pith.science/pith/34ZWMVFTURVYMHAT4DZBP2O2PG/action/author_attestation","sign_citation":"https://pith.science/pith/34ZWMVFTURVYMHAT4DZBP2O2PG/action/citation_signature","submit_replication":"https://pith.science/pith/34ZWMVFTURVYMHAT4DZBP2O2PG/action/replication_record"}},"created_at":"2026-07-30T01:22:30.501092+00:00","updated_at":"2026-07-30T01:22:30.501092+00:00"}