{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:FEVTYVIX72YHID5SC7LU4SRDH6","short_pith_number":"pith:FEVTYVIX","schema_version":"1.0","canonical_sha256":"292b3c5517feb0740fb217d74e4a233f894799860db1e21be49dfd0c11181fd2","source":{"kind":"arxiv","id":"math/0406140","version":5},"attestation_state":"computed","paper":{"title":"The structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrei Gagarin, Gilbert Labelle, Pierre Leroux (LACIM, Universite du Quebec a Montreal)","submitted_at":"2004-06-08T04:22:43Z","abstract_excerpt":"We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by two-pole networks constructed from 2-connected planar graphs. A method to enumerate these graphs in the labelled case is described. Moreover, we enumerate the homeomorphically irreducible graphs in F and homeomorphically irreducible 2-connected planar graphs. Particular use is made of two-pole directed series-parallel networks. We also show that the number m"},"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":"math/0406140","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2004-06-08T04:22:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"992e946ab8c92e389d246270fd32f5caf74f8367d0633eb120fecc9db711aa9d","abstract_canon_sha256":"46b4be0e861b569a90971e2d8a2e596b60c523efda6d3494b203f4b8640165b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:43.998862Z","signature_b64":"LdcjEn7cQ7/0W40u06Yi3ebO3A9loYBRxNe603Tu0GEy1yA6RlTZV2ih7V2Krt9bNXY5T5zVDHsETZubA/EhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292b3c5517feb0740fb217d74e4a233f894799860db1e21be49dfd0c11181fd2","last_reissued_at":"2026-05-18T04:32:43.998392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:43.998392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrei Gagarin, Gilbert Labelle, Pierre Leroux (LACIM, Universite du Quebec a Montreal)","submitted_at":"2004-06-08T04:22:43Z","abstract_excerpt":"We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by two-pole networks constructed from 2-connected planar graphs. A method to enumerate these graphs in the labelled case is described. Moreover, we enumerate the homeomorphically irreducible graphs in F and homeomorphically irreducible 2-connected planar graphs. Particular use is made of two-pole directed series-parallel networks. We also show that the number m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0406140","kind":"arxiv","version":5},"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":"math/0406140","created_at":"2026-05-18T04:32:43.998467+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0406140v5","created_at":"2026-05-18T04:32:43.998467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0406140","created_at":"2026-05-18T04:32:43.998467+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEVTYVIX72YH","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEVTYVIX72YHID5S","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEVTYVIX","created_at":"2026-05-18T12:25:52.687210+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/FEVTYVIX72YHID5SC7LU4SRDH6","json":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6.json","graph_json":"https://pith.science/api/pith-number/FEVTYVIX72YHID5SC7LU4SRDH6/graph.json","events_json":"https://pith.science/api/pith-number/FEVTYVIX72YHID5SC7LU4SRDH6/events.json","paper":"https://pith.science/paper/FEVTYVIX"},"agent_actions":{"view_html":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6","download_json":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6.json","view_paper":"https://pith.science/paper/FEVTYVIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0406140&json=true","fetch_graph":"https://pith.science/api/pith-number/FEVTYVIX72YHID5SC7LU4SRDH6/graph.json","fetch_events":"https://pith.science/api/pith-number/FEVTYVIX72YHID5SC7LU4SRDH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/action/storage_attestation","attest_author":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/action/author_attestation","sign_citation":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/action/citation_signature","submit_replication":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/action/replication_record"}},"created_at":"2026-05-18T04:32:43.998467+00:00","updated_at":"2026-05-18T04:32:43.998467+00:00"}