{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:FEVTYVIX72YHID5SC7LU4SRDH6","short_pith_number":"pith:FEVTYVIX","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"},"canonical_sha256":"292b3c5517feb0740fb217d74e4a233f894799860db1e21be49dfd0c11181fd2","source":{"kind":"arxiv","id":"math/0406140","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0406140","created_at":"2026-05-18T04:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"math/0406140v5","created_at":"2026-05-18T04:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0406140","created_at":"2026-05-18T04:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"FEVTYVIX72YH","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"FEVTYVIX72YHID5S","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"FEVTYVIX","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:FEVTYVIX72YHID5SC7LU4SRDH6","target":"record","payload":{"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"},"canonical_sha256":"292b3c5517feb0740fb217d74e4a233f894799860db1e21be49dfd0c11181fd2","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"},"source_kind":"arxiv","source_id":"math/0406140","source_version":5,"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-05-18T04:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEVnju6GOQiaSTsav9C5sR5cfJYulramSFsRO//V27G5W+RtZ54ahnbs/tTfWBCrVm4Szx1DWgBVjWpebI4DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:32:55.881945Z"},"content_sha256":"9145e0e544fde87e17af9aa15c18fa9a24f0e4627bf768e664bd4ba1b974ab29","schema_version":"1.0","event_id":"sha256:9145e0e544fde87e17af9aa15c18fa9a24f0e4627bf768e664bd4ba1b974ab29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:FEVTYVIX72YHID5SC7LU4SRDH6","target":"graph","payload":{"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"},"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-05-18T04:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVAFDVnzuDwD7/iPo75mZ/OLaN8OMpOyM8jAG9BKX9HRDb2ThLVhrivr48VuOfn3LhtKrixAx6E5ED/1qS39AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:32:55.882659Z"},"content_sha256":"0767e099330dc0055675e8d30267eddd97f7988a74093f5e55a40a83b5582500","schema_version":"1.0","event_id":"sha256:0767e099330dc0055675e8d30267eddd97f7988a74093f5e55a40a83b5582500"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/bundle.json","state_url":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEVTYVIX72YHID5SC7LU4SRDH6/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-06-10T04:32:55Z","links":{"resolver":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6","bundle":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/bundle.json","state":"https://pith.science/pith/FEVTYVIX72YHID5SC7LU4SRDH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEVTYVIX72YHID5SC7LU4SRDH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:FEVTYVIX72YHID5SC7LU4SRDH6","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":"46b4be0e861b569a90971e2d8a2e596b60c523efda6d3494b203f4b8640165b2","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"math.CO","submitted_at":"2004-06-08T04:22:43Z","title_canon_sha256":"992e946ab8c92e389d246270fd32f5caf74f8367d0633eb120fecc9db711aa9d"},"schema_version":"1.0","source":{"id":"math/0406140","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0406140","created_at":"2026-05-18T04:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"math/0406140v5","created_at":"2026-05-18T04:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0406140","created_at":"2026-05-18T04:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"FEVTYVIX72YH","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"FEVTYVIX72YHID5S","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"FEVTYVIX","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:0767e099330dc0055675e8d30267eddd97f7988a74093f5e55a40a83b5582500","target":"graph","created_at":"2026-05-18T04:32:43Z","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"},"paper":{"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","authors_text":"Andrei Gagarin, Gilbert Labelle, Pierre Leroux (LACIM, Universite du Quebec a Montreal)","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2004-06-08T04:22:43Z","title":"The structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0406140","kind":"arxiv","version":5},"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:9145e0e544fde87e17af9aa15c18fa9a24f0e4627bf768e664bd4ba1b974ab29","target":"record","created_at":"2026-05-18T04:32:43Z","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":"46b4be0e861b569a90971e2d8a2e596b60c523efda6d3494b203f4b8640165b2","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"math.CO","submitted_at":"2004-06-08T04:22:43Z","title_canon_sha256":"992e946ab8c92e389d246270fd32f5caf74f8367d0633eb120fecc9db711aa9d"},"schema_version":"1.0","source":{"id":"math/0406140","kind":"arxiv","version":5}},"canonical_sha256":"292b3c5517feb0740fb217d74e4a233f894799860db1e21be49dfd0c11181fd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"292b3c5517feb0740fb217d74e4a233f894799860db1e21be49dfd0c11181fd2","first_computed_at":"2026-05-18T04:32:43.998392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:43.998392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LdcjEn7cQ7/0W40u06Yi3ebO3A9loYBRxNe603Tu0GEy1yA6RlTZV2ih7V2Krt9bNXY5T5zVDHsETZubA/EhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:43.998862Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0406140","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9145e0e544fde87e17af9aa15c18fa9a24f0e4627bf768e664bd4ba1b974ab29","sha256:0767e099330dc0055675e8d30267eddd97f7988a74093f5e55a40a83b5582500"],"state_sha256":"725116a847d34cc7d291205d194320eda7c0cba6d0ee050d3d0a6f7e62d093c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWWGCNL/5q89pUFrrWLMgn9JzSHvBPpAnBUxKQTjkiD9uKe6f1tGc0VqOtWxFo0CpOUDz72ILcsF427A6rFVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:32:55.887214Z","bundle_sha256":"b678097f8673e374378ff8f6e8b313fd733d9d62de768c9c0c84a5b4e8d9ee90"}}