{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZNXH3C4RS2IKG4ZKH6AOZLCB6G","short_pith_number":"pith:ZNXH3C4R","schema_version":"1.0","canonical_sha256":"cb6e7d8b919690a3732a3f80ecac41f1b383cb2f5063c356a21f9d48007fadd7","source":{"kind":"arxiv","id":"1002.1891","version":1},"attestation_state":"computed","paper":{"title":"Irreducible pseudo 2-factor isomorphic cubic bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Labbate, J. Sheehan, M. Abreu","submitted_at":"2010-02-09T15:39:27Z","abstract_excerpt":"A bipartite graph is {\\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \\cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph of girth 4 is $K_{3,3}$, and conjectured \\cite[Conjecture 3.6]{ADJLS} that the only essentially 4--edge-connected cubic bipartite graphs are $K_{3,3}$, the Heawood graph and the Pappus graph.\n  There exists a characterization of symmetric configurations $n_3$ %{\\bf decide notation and how to use it in the rest of the paper} due to Martinetti (1886) in which"},"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":"1002.1891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-09T15:39:27Z","cross_cats_sorted":[],"title_canon_sha256":"333821341b3755c0df9fb7c8429c16f471002845dcb84e19eaee4e93d7389880","abstract_canon_sha256":"960c1d542650b50da2b5cfef440e5d0f796624ae7db79091b9a74fa475f7c93c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:44.474580Z","signature_b64":"zseO88222RZAQZFBWAkfvd24Cv6A0QoUsStn70EKJ9xRwt8z/Z1qYYmSAVtGzOxGpJ4fFXIbYAacFf72lMgvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb6e7d8b919690a3732a3f80ecac41f1b383cb2f5063c356a21f9d48007fadd7","last_reissued_at":"2026-05-18T02:29:44.474152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:44.474152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irreducible pseudo 2-factor isomorphic cubic bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Labbate, J. Sheehan, M. Abreu","submitted_at":"2010-02-09T15:39:27Z","abstract_excerpt":"A bipartite graph is {\\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \\cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph of girth 4 is $K_{3,3}$, and conjectured \\cite[Conjecture 3.6]{ADJLS} that the only essentially 4--edge-connected cubic bipartite graphs are $K_{3,3}$, the Heawood graph and the Pappus graph.\n  There exists a characterization of symmetric configurations $n_3$ %{\\bf decide notation and how to use it in the rest of the paper} due to Martinetti (1886) in which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.1891","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":""},"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":"1002.1891","created_at":"2026-05-18T02:29:44.474212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.1891v1","created_at":"2026-05-18T02:29:44.474212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.1891","created_at":"2026-05-18T02:29:44.474212+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNXH3C4RS2IK","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNXH3C4RS2IKG4ZK","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNXH3C4R","created_at":"2026-05-18T12:26:18.847500+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/ZNXH3C4RS2IKG4ZKH6AOZLCB6G","json":"https://pith.science/pith/ZNXH3C4RS2IKG4ZKH6AOZLCB6G.json","graph_json":"https://pith.science/api/pith-number/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/graph.json","events_json":"https://pith.science/api/pith-number/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/events.json","paper":"https://pith.science/paper/ZNXH3C4R"},"agent_actions":{"view_html":"https://pith.science/pith/ZNXH3C4RS2IKG4ZKH6AOZLCB6G","download_json":"https://pith.science/pith/ZNXH3C4RS2IKG4ZKH6AOZLCB6G.json","view_paper":"https://pith.science/paper/ZNXH3C4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.1891&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/action/storage_attestation","attest_author":"https://pith.science/pith/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/action/author_attestation","sign_citation":"https://pith.science/pith/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/action/citation_signature","submit_replication":"https://pith.science/pith/ZNXH3C4RS2IKG4ZKH6AOZLCB6G/action/replication_record"}},"created_at":"2026-05-18T02:29:44.474212+00:00","updated_at":"2026-05-18T02:29:44.474212+00:00"}