{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OLIDPDLSJSVBOZ24SUWRS7ISGE","short_pith_number":"pith:OLIDPDLS","canonical_record":{"source":{"id":"1608.01445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T07:32:27Z","cross_cats_sorted":[],"title_canon_sha256":"7103bbdbe5daa2d2e89549c268133ed7fe34c3bd1acb53e5a7b6bf102427a50f","abstract_canon_sha256":"d9fbccc03a4c65c3d58a1cc327a96c1a01443b057186835e12fa7a6958f5acfb"},"schema_version":"1.0"},"canonical_sha256":"72d0378d724caa17675c952d197d123105ff6302af28cc246688337e076f5fea","source":{"kind":"arxiv","id":"1608.01445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01445","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01445v1","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01445","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"OLIDPDLSJSVB","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OLIDPDLSJSVBOZ24","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OLIDPDLS","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OLIDPDLSJSVBOZ24SUWRS7ISGE","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T07:32:27Z","cross_cats_sorted":[],"title_canon_sha256":"7103bbdbe5daa2d2e89549c268133ed7fe34c3bd1acb53e5a7b6bf102427a50f","abstract_canon_sha256":"d9fbccc03a4c65c3d58a1cc327a96c1a01443b057186835e12fa7a6958f5acfb"},"schema_version":"1.0"},"canonical_sha256":"72d0378d724caa17675c952d197d123105ff6302af28cc246688337e076f5fea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:52.421064Z","signature_b64":"Fc+8761GcgaDFnU0ZBfiMtX7He5qbHCzHZa5egliJtt7NDKnzMTid7ECC0rOJ2FmB66DVmmRDmpcpDUm3Ec/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72d0378d724caa17675c952d197d123105ff6302af28cc246688337e076f5fea","last_reissued_at":"2026-05-18T01:09:52.420486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:52.420486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01445","source_version":1,"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-18T01:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XckhyD5J/WmiSC8P3JG/upiX03Ier5ki/iWn1cJp5FppoQYYOuE13Uy9GZ6Tb+RvgAG+G++OnZdX0yLOr5UWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:10:21.815145Z"},"content_sha256":"12e77ad2bf327e3f832bf2a9dc73c4d08468f6a4a9b335a5a73698deac24aac5","schema_version":"1.0","event_id":"sha256:12e77ad2bf327e3f832bf2a9dc73c4d08468f6a4a9b335a5a73698deac24aac5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OLIDPDLSJSVBOZ24SUWRS7ISGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On minimal graphs containing k perfect matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gasper Fijavz, Matthias Kriesell","submitted_at":"2016-08-04T07:32:27Z","abstract_excerpt":"We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge of G by a path of odd length connecting its end vertices such that all these paths are internally disjoint. We prove that for every k>0 there exists a finite set of graphs S(k) such that every minimally k-matchable graph is isomorphic to a disjoint union of an odd subdivision of some graph from S(k) and any number of copies of the complete graph on two vert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01445","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"},"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-18T01:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdOhznujUca35fzjhzsgQFkFbEBpN2C8OYOY21hlhfBEQj5eLVRdFfThUxL9Odo1Lv6forvuLIJHiP7HsSUKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:10:21.815508Z"},"content_sha256":"21b3de9f6184f23980936f20362d0a70fa99251b58bb5a25af23921a25a2f726","schema_version":"1.0","event_id":"sha256:21b3de9f6184f23980936f20362d0a70fa99251b58bb5a25af23921a25a2f726"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLIDPDLSJSVBOZ24SUWRS7ISGE/bundle.json","state_url":"https://pith.science/pith/OLIDPDLSJSVBOZ24SUWRS7ISGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLIDPDLSJSVBOZ24SUWRS7ISGE/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-22T17:10:21Z","links":{"resolver":"https://pith.science/pith/OLIDPDLSJSVBOZ24SUWRS7ISGE","bundle":"https://pith.science/pith/OLIDPDLSJSVBOZ24SUWRS7ISGE/bundle.json","state":"https://pith.science/pith/OLIDPDLSJSVBOZ24SUWRS7ISGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLIDPDLSJSVBOZ24SUWRS7ISGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OLIDPDLSJSVBOZ24SUWRS7ISGE","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":"d9fbccc03a4c65c3d58a1cc327a96c1a01443b057186835e12fa7a6958f5acfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T07:32:27Z","title_canon_sha256":"7103bbdbe5daa2d2e89549c268133ed7fe34c3bd1acb53e5a7b6bf102427a50f"},"schema_version":"1.0","source":{"id":"1608.01445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01445","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01445v1","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01445","created_at":"2026-05-18T01:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"OLIDPDLSJSVB","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OLIDPDLSJSVBOZ24","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OLIDPDLS","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:21b3de9f6184f23980936f20362d0a70fa99251b58bb5a25af23921a25a2f726","target":"graph","created_at":"2026-05-18T01:09:52Z","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 call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge of G by a path of odd length connecting its end vertices such that all these paths are internally disjoint. We prove that for every k>0 there exists a finite set of graphs S(k) such that every minimally k-matchable graph is isomorphic to a disjoint union of an odd subdivision of some graph from S(k) and any number of copies of the complete graph on two vert","authors_text":"Gasper Fijavz, Matthias Kriesell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T07:32:27Z","title":"On minimal graphs containing k perfect matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01445","kind":"arxiv","version":1},"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:12e77ad2bf327e3f832bf2a9dc73c4d08468f6a4a9b335a5a73698deac24aac5","target":"record","created_at":"2026-05-18T01:09:52Z","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":"d9fbccc03a4c65c3d58a1cc327a96c1a01443b057186835e12fa7a6958f5acfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-04T07:32:27Z","title_canon_sha256":"7103bbdbe5daa2d2e89549c268133ed7fe34c3bd1acb53e5a7b6bf102427a50f"},"schema_version":"1.0","source":{"id":"1608.01445","kind":"arxiv","version":1}},"canonical_sha256":"72d0378d724caa17675c952d197d123105ff6302af28cc246688337e076f5fea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72d0378d724caa17675c952d197d123105ff6302af28cc246688337e076f5fea","first_computed_at":"2026-05-18T01:09:52.420486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:52.420486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fc+8761GcgaDFnU0ZBfiMtX7He5qbHCzHZa5egliJtt7NDKnzMTid7ECC0rOJ2FmB66DVmmRDmpcpDUm3Ec/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:52.421064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12e77ad2bf327e3f832bf2a9dc73c4d08468f6a4a9b335a5a73698deac24aac5","sha256:21b3de9f6184f23980936f20362d0a70fa99251b58bb5a25af23921a25a2f726"],"state_sha256":"a56e0830f4040ad2594db0356c49b13f6e58a782276c6b1041497c09629c60a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wHcYMuHdkDYz9pHWBLHGT2og95Cv+YbWXQ86By6RNWO/UhMxIz43YWPzrf8knPDRrKkYfzD/schrCI0bvI7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:10:21.819830Z","bundle_sha256":"62bbb3fa390c13e91d5a19fc822db22f3695e1a08a29c053b0e5489910f03b64"}}