{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E3WTRICJ6ABC5X26TCRMQU4K7D","short_pith_number":"pith:E3WTRICJ","schema_version":"1.0","canonical_sha256":"26ed38a049f0022edf5e98a2c8538af8d37a818d1bfbbd13e2eaef07edb9b33e","source":{"kind":"arxiv","id":"1204.1989","version":1},"attestation_state":"computed","paper":{"title":"Multiple Petersen subdivisions in permutation graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jean-S\\'ebastien Sereni, Tom\\'a\\v{s} Kaiser, Zelealem Yilma","submitted_at":"2012-04-09T20:53:18Z","abstract_excerpt":"A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing an edge of M contains e, then e is contained in a subdivision of the Petersen graph of a special type. In particular, if the graph is cyclically 5-edge-connected, then every edge of M is contained in such a subdivision. Our proof is based on a characterization of cographs in terms of twin vertices. We infer a linear lower bound on the number of Petersen sub"},"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":"1204.1989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-09T20:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"006799453f34587bf1f2af6ef07f53cca970dd88dfcac22a8e50af5fa3cb3f27","abstract_canon_sha256":"b567ed8bf81f8cbbfc72607da55a62ea2b614a139658e6a1dfa0c370afb8c30f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:13.580772Z","signature_b64":"HXbEPY12sEG9ZtuOWle5S6Nfa2Jxm8W3VL/gRtBKwMGF/PDG/OpUIYxwSBXI0Bz4zeHrckbomiyb0L0VJUuNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26ed38a049f0022edf5e98a2c8538af8d37a818d1bfbbd13e2eaef07edb9b33e","last_reissued_at":"2026-05-18T03:58:13.580334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:13.580334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple Petersen subdivisions in permutation graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jean-S\\'ebastien Sereni, Tom\\'a\\v{s} Kaiser, Zelealem Yilma","submitted_at":"2012-04-09T20:53:18Z","abstract_excerpt":"A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing an edge of M contains e, then e is contained in a subdivision of the Petersen graph of a special type. In particular, if the graph is cyclically 5-edge-connected, then every edge of M is contained in such a subdivision. Our proof is based on a characterization of cographs in terms of twin vertices. We infer a linear lower bound on the number of Petersen sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1989","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":"1204.1989","created_at":"2026-05-18T03:58:13.580399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1989v1","created_at":"2026-05-18T03:58:13.580399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1989","created_at":"2026-05-18T03:58:13.580399+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3WTRICJ6ABC","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3WTRICJ6ABC5X26","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3WTRICJ","created_at":"2026-05-18T12:27:04.183437+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/E3WTRICJ6ABC5X26TCRMQU4K7D","json":"https://pith.science/pith/E3WTRICJ6ABC5X26TCRMQU4K7D.json","graph_json":"https://pith.science/api/pith-number/E3WTRICJ6ABC5X26TCRMQU4K7D/graph.json","events_json":"https://pith.science/api/pith-number/E3WTRICJ6ABC5X26TCRMQU4K7D/events.json","paper":"https://pith.science/paper/E3WTRICJ"},"agent_actions":{"view_html":"https://pith.science/pith/E3WTRICJ6ABC5X26TCRMQU4K7D","download_json":"https://pith.science/pith/E3WTRICJ6ABC5X26TCRMQU4K7D.json","view_paper":"https://pith.science/paper/E3WTRICJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1989&json=true","fetch_graph":"https://pith.science/api/pith-number/E3WTRICJ6ABC5X26TCRMQU4K7D/graph.json","fetch_events":"https://pith.science/api/pith-number/E3WTRICJ6ABC5X26TCRMQU4K7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3WTRICJ6ABC5X26TCRMQU4K7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3WTRICJ6ABC5X26TCRMQU4K7D/action/storage_attestation","attest_author":"https://pith.science/pith/E3WTRICJ6ABC5X26TCRMQU4K7D/action/author_attestation","sign_citation":"https://pith.science/pith/E3WTRICJ6ABC5X26TCRMQU4K7D/action/citation_signature","submit_replication":"https://pith.science/pith/E3WTRICJ6ABC5X26TCRMQU4K7D/action/replication_record"}},"created_at":"2026-05-18T03:58:13.580399+00:00","updated_at":"2026-05-18T03:58:13.580399+00:00"}