{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6QNW7XJUN6FF4IQIB42OC4MQEK","short_pith_number":"pith:6QNW7XJU","canonical_record":{"source":{"id":"1812.05461","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T14:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"631cc580adae16970cc6f92c9a1bb5a9f93fa4b2f11147024fa683313dc544c3","abstract_canon_sha256":"4e052d9860eabc97845c7707d5bfcb788f24a1dfa9d59c260405e18aa1c6cc00"},"schema_version":"1.0"},"canonical_sha256":"f41b6fdd346f8a5e22080f34e1719022b7afaac95c67440290b27a9dfc255902","source":{"kind":"arxiv","id":"1812.05461","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05461","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05461v3","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05461","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"6QNW7XJUN6FF","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6QNW7XJUN6FF4IQI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6QNW7XJU","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6QNW7XJUN6FF4IQIB42OC4MQEK","target":"record","payload":{"canonical_record":{"source":{"id":"1812.05461","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T14:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"631cc580adae16970cc6f92c9a1bb5a9f93fa4b2f11147024fa683313dc544c3","abstract_canon_sha256":"4e052d9860eabc97845c7707d5bfcb788f24a1dfa9d59c260405e18aa1c6cc00"},"schema_version":"1.0"},"canonical_sha256":"f41b6fdd346f8a5e22080f34e1719022b7afaac95c67440290b27a9dfc255902","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:26.925180Z","signature_b64":"KOkbZPUb5Fcg5ZGCI193lX2hpVYqpIwCXrF8vBAz7Iud42OmTJabW49xr/Q5iCjlHZFjYe2FhvBT9hV3ZlGJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f41b6fdd346f8a5e22080f34e1719022b7afaac95c67440290b27a9dfc255902","last_reissued_at":"2026-05-17T23:52:26.924738Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:26.924738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.05461","source_version":3,"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-17T23:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHU8o3nR+NKOzlwUCaU5E0AIQbyqSVAtWKnlrxR08JKYsatGAeED6/6pYBl3c0tZ9v8+qdwP/IsUOL3mwBkPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:05:00.864876Z"},"content_sha256":"054d76bb841126791ad3d6020615fadcb59c592a3e3da2b6e91ec3f134105cb9","schema_version":"1.0","event_id":"sha256:054d76bb841126791ad3d6020615fadcb59c592a3e3da2b6e91ec3f134105cb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6QNW7XJUN6FF4IQIB42OC4MQEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Isabel Beckenbach, Meike Hatzel, Sebastian Wiederrecht","submitted_at":"2018-12-13T14:43:03Z","abstract_excerpt":"The perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lov\\'asz and Plummer developed a decomposition theory for graphs with perfect matchings and their corresponding polytopes known as the tight cut decomposition which breaks down every graph into a number of indecomposable graphs, so called bricks. For many properties that are of interest on graphs with perfect matchings, including the description of the perfect matching polytope, it suffices to consider these bricks. A key result by Lov\\'as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05461","kind":"arxiv","version":3},"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-17T23:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOgVQITLA6zm8dYwdDVmBYgcjI0Lhf5thzjN+3pi1to7dGVv2PYjXCWr0bb3WRztwoT4+YEgJkI1wRcp0UW8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:05:00.865572Z"},"content_sha256":"baaac4d26cce9f47d0fb748a1f6d30b33fe4d07320a36b186c1c2f3f68c07840","schema_version":"1.0","event_id":"sha256:baaac4d26cce9f47d0fb748a1f6d30b33fe4d07320a36b186c1c2f3f68c07840"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QNW7XJUN6FF4IQIB42OC4MQEK/bundle.json","state_url":"https://pith.science/pith/6QNW7XJUN6FF4IQIB42OC4MQEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QNW7XJUN6FF4IQIB42OC4MQEK/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-05-26T23:05:00Z","links":{"resolver":"https://pith.science/pith/6QNW7XJUN6FF4IQIB42OC4MQEK","bundle":"https://pith.science/pith/6QNW7XJUN6FF4IQIB42OC4MQEK/bundle.json","state":"https://pith.science/pith/6QNW7XJUN6FF4IQIB42OC4MQEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QNW7XJUN6FF4IQIB42OC4MQEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6QNW7XJUN6FF4IQIB42OC4MQEK","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":"4e052d9860eabc97845c7707d5bfcb788f24a1dfa9d59c260405e18aa1c6cc00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T14:43:03Z","title_canon_sha256":"631cc580adae16970cc6f92c9a1bb5a9f93fa4b2f11147024fa683313dc544c3"},"schema_version":"1.0","source":{"id":"1812.05461","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05461","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05461v3","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05461","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"6QNW7XJUN6FF","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6QNW7XJUN6FF4IQI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6QNW7XJU","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:baaac4d26cce9f47d0fb748a1f6d30b33fe4d07320a36b186c1c2f3f68c07840","target":"graph","created_at":"2026-05-17T23:52:26Z","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 perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lov\\'asz and Plummer developed a decomposition theory for graphs with perfect matchings and their corresponding polytopes known as the tight cut decomposition which breaks down every graph into a number of indecomposable graphs, so called bricks. For many properties that are of interest on graphs with perfect matchings, including the description of the perfect matching polytope, it suffices to consider these bricks. A key result by Lov\\'as","authors_text":"Isabel Beckenbach, Meike Hatzel, Sebastian Wiederrecht","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T14:43:03Z","title":"The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05461","kind":"arxiv","version":3},"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:054d76bb841126791ad3d6020615fadcb59c592a3e3da2b6e91ec3f134105cb9","target":"record","created_at":"2026-05-17T23:52:26Z","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":"4e052d9860eabc97845c7707d5bfcb788f24a1dfa9d59c260405e18aa1c6cc00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T14:43:03Z","title_canon_sha256":"631cc580adae16970cc6f92c9a1bb5a9f93fa4b2f11147024fa683313dc544c3"},"schema_version":"1.0","source":{"id":"1812.05461","kind":"arxiv","version":3}},"canonical_sha256":"f41b6fdd346f8a5e22080f34e1719022b7afaac95c67440290b27a9dfc255902","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f41b6fdd346f8a5e22080f34e1719022b7afaac95c67440290b27a9dfc255902","first_computed_at":"2026-05-17T23:52:26.924738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:26.924738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KOkbZPUb5Fcg5ZGCI193lX2hpVYqpIwCXrF8vBAz7Iud42OmTJabW49xr/Q5iCjlHZFjYe2FhvBT9hV3ZlGJCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:26.925180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05461","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:054d76bb841126791ad3d6020615fadcb59c592a3e3da2b6e91ec3f134105cb9","sha256:baaac4d26cce9f47d0fb748a1f6d30b33fe4d07320a36b186c1c2f3f68c07840"],"state_sha256":"653f526c9e8ddd7ca6603f4d220eaacb1eeda6228b4a8b0ec828dce4bb6e2a4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zT9TornZrbuiwoPqcTwBfGyZkvQhpi3COpOq/SYFwORzWnG9aOE4yDyqsyFNFqQZlS2f0XSrmrVpBSUjtm+bBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:05:00.869183Z","bundle_sha256":"3400c90f277485287ce0c9f0140a9cf04da4c26683c4e2df9680b97e8e3cbe22"}}