{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FV5Q2DXJYQQI6ECQTECAMD7I5D","short_pith_number":"pith:FV5Q2DXJ","canonical_record":{"source":{"id":"1301.6926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-29T14:24:03Z","cross_cats_sorted":[],"title_canon_sha256":"3088d289b879d70e3a2de6da83e1e5b70f5a1de70495a5a725170a3e512944f7","abstract_canon_sha256":"42bb3f030aeb4d6e250721d910655b0aef8edf56c507f2753e94ec045e50e5ca"},"schema_version":"1.0"},"canonical_sha256":"2d7b0d0ee9c4208f10509904060fe8e8c9f04f8c8fc4e80f8546a8ea7fbf06d8","source":{"kind":"arxiv","id":"1301.6926","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6926","created_at":"2026-05-18T02:42:46Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6926v2","created_at":"2026-05-18T02:42:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6926","created_at":"2026-05-18T02:42:46Z"},{"alias_kind":"pith_short_12","alias_value":"FV5Q2DXJYQQI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FV5Q2DXJYQQI6ECQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FV5Q2DXJ","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FV5Q2DXJYQQI6ECQTECAMD7I5D","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-29T14:24:03Z","cross_cats_sorted":[],"title_canon_sha256":"3088d289b879d70e3a2de6da83e1e5b70f5a1de70495a5a725170a3e512944f7","abstract_canon_sha256":"42bb3f030aeb4d6e250721d910655b0aef8edf56c507f2753e94ec045e50e5ca"},"schema_version":"1.0"},"canonical_sha256":"2d7b0d0ee9c4208f10509904060fe8e8c9f04f8c8fc4e80f8546a8ea7fbf06d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:46.748765Z","signature_b64":"poYUK1Nj7pBBuSjoEn5B9jgh5o58Koeb+iNhqgjl97kobxR0qk3q99G14bgxFxEckl4v8olGZ8eBIV6liqIcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7b0d0ee9c4208f10509904060fe8e8c9f04f8c8fc4e80f8546a8ea7fbf06d8","last_reissued_at":"2026-05-18T02:42:46.748341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:46.748341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6926","source_version":2,"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-18T02:42:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5jyMoWin0fWQ4IhSIrZbeKdplYFCyAopk5ASwokgDZ7SJUILef0jYoCP7EBKgbZAJX/fOWRv+Wx3ZwC2wjQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:09:27.584907Z"},"content_sha256":"04246f36b51080aaa104d91a04ad485a497f5e278405e0491a1ecdc381661064","schema_version":"1.0","event_id":"sha256:04246f36b51080aaa104d91a04ad485a497f5e278405e0491a1ecdc381661064"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FV5Q2DXJYQQI6ECQTECAMD7I5D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giuseppe Mazzuoccolo, Louis Esperet","submitted_at":"2013-01-29T14:24:03Z","abstract_excerpt":"The problem of establishing the number of perfect matchings necessary to cover the edge-set of a cubic bridgeless graph is strictly related to a famous conjecture of Berge and Fulkerson. In this paper we prove that deciding whether this number is at most 4 for a given cubic bridgeless graph is NP-complete. We also construct an infinite family $\\cal F$ of snarks (cyclically 4-edge-connected cubic graphs of girth at least five and chromatic index four) whose edge-set cannot be covered by 4 perfect matchings. Only two such graphs were known. It turns out that the family $\\cal F$ also has interest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6926","kind":"arxiv","version":2},"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-18T02:42:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0Oq4Jglrt5tQA0AtpP4BkVFpzhC4rQjXXSTFKn0dQAX3e8thdN17jn9DotUPPd17va/gh9J3RwOmxCj1Vx4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:09:27.585643Z"},"content_sha256":"8ff990d568eb2164a0d58e4d7be16d67c8e6fac17e9415ec2b669d0721cdc823","schema_version":"1.0","event_id":"sha256:8ff990d568eb2164a0d58e4d7be16d67c8e6fac17e9415ec2b669d0721cdc823"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FV5Q2DXJYQQI6ECQTECAMD7I5D/bundle.json","state_url":"https://pith.science/pith/FV5Q2DXJYQQI6ECQTECAMD7I5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FV5Q2DXJYQQI6ECQTECAMD7I5D/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-09T19:09:27Z","links":{"resolver":"https://pith.science/pith/FV5Q2DXJYQQI6ECQTECAMD7I5D","bundle":"https://pith.science/pith/FV5Q2DXJYQQI6ECQTECAMD7I5D/bundle.json","state":"https://pith.science/pith/FV5Q2DXJYQQI6ECQTECAMD7I5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FV5Q2DXJYQQI6ECQTECAMD7I5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FV5Q2DXJYQQI6ECQTECAMD7I5D","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":"42bb3f030aeb4d6e250721d910655b0aef8edf56c507f2753e94ec045e50e5ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-29T14:24:03Z","title_canon_sha256":"3088d289b879d70e3a2de6da83e1e5b70f5a1de70495a5a725170a3e512944f7"},"schema_version":"1.0","source":{"id":"1301.6926","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6926","created_at":"2026-05-18T02:42:46Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6926v2","created_at":"2026-05-18T02:42:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6926","created_at":"2026-05-18T02:42:46Z"},{"alias_kind":"pith_short_12","alias_value":"FV5Q2DXJYQQI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FV5Q2DXJYQQI6ECQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FV5Q2DXJ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:8ff990d568eb2164a0d58e4d7be16d67c8e6fac17e9415ec2b669d0721cdc823","target":"graph","created_at":"2026-05-18T02:42:46Z","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":"The problem of establishing the number of perfect matchings necessary to cover the edge-set of a cubic bridgeless graph is strictly related to a famous conjecture of Berge and Fulkerson. In this paper we prove that deciding whether this number is at most 4 for a given cubic bridgeless graph is NP-complete. We also construct an infinite family $\\cal F$ of snarks (cyclically 4-edge-connected cubic graphs of girth at least five and chromatic index four) whose edge-set cannot be covered by 4 perfect matchings. Only two such graphs were known. It turns out that the family $\\cal F$ also has interest","authors_text":"Giuseppe Mazzuoccolo, Louis Esperet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-29T14:24:03Z","title":"On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6926","kind":"arxiv","version":2},"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:04246f36b51080aaa104d91a04ad485a497f5e278405e0491a1ecdc381661064","target":"record","created_at":"2026-05-18T02:42:46Z","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":"42bb3f030aeb4d6e250721d910655b0aef8edf56c507f2753e94ec045e50e5ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-29T14:24:03Z","title_canon_sha256":"3088d289b879d70e3a2de6da83e1e5b70f5a1de70495a5a725170a3e512944f7"},"schema_version":"1.0","source":{"id":"1301.6926","kind":"arxiv","version":2}},"canonical_sha256":"2d7b0d0ee9c4208f10509904060fe8e8c9f04f8c8fc4e80f8546a8ea7fbf06d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d7b0d0ee9c4208f10509904060fe8e8c9f04f8c8fc4e80f8546a8ea7fbf06d8","first_computed_at":"2026-05-18T02:42:46.748341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:46.748341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"poYUK1Nj7pBBuSjoEn5B9jgh5o58Koeb+iNhqgjl97kobxR0qk3q99G14bgxFxEckl4v8olGZ8eBIV6liqIcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:46.748765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6926","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04246f36b51080aaa104d91a04ad485a497f5e278405e0491a1ecdc381661064","sha256:8ff990d568eb2164a0d58e4d7be16d67c8e6fac17e9415ec2b669d0721cdc823"],"state_sha256":"c7aea62af620abb2b10f801edec719a7f27883313ecb27f4556f5ad82bf52a2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFiCuclGVs1eo5XDVZbS5/bGoewPIkYPLULg/RRuK3xL/XFGWaL2QY0wZFdjrntESpcfjGvo/wH690C7ewH8Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:09:27.590024Z","bundle_sha256":"b9955d3d8d2041d85a6954004dd6c3d2dfd6d3416cdebff094dfab7c952cb75e"}}