{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WN6FOW36UEAV7DZAFAKEQUY6EH","short_pith_number":"pith:WN6FOW36","canonical_record":{"source":{"id":"1509.05586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T10:55:58Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"372f651f13d8c7c19f610f5a7bbc7f6f7ecf5e09f943012b051abe789d3deabe","abstract_canon_sha256":"6e88832f7eca894b5333449688f9cc8756b2c71cff6f5453e7e098ab88ef85f6"},"schema_version":"1.0"},"canonical_sha256":"b37c575b7ea1015f8f20281448531e21f2148ef3b1001c9044802876c05ff816","source":{"kind":"arxiv","id":"1509.05586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05586","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05586v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05586","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"WN6FOW36UEAV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WN6FOW36UEAV7DZA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WN6FOW36","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WN6FOW36UEAV7DZAFAKEQUY6EH","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T10:55:58Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"372f651f13d8c7c19f610f5a7bbc7f6f7ecf5e09f943012b051abe789d3deabe","abstract_canon_sha256":"6e88832f7eca894b5333449688f9cc8756b2c71cff6f5453e7e098ab88ef85f6"},"schema_version":"1.0"},"canonical_sha256":"b37c575b7ea1015f8f20281448531e21f2148ef3b1001c9044802876c05ff816","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.789427Z","signature_b64":"of/4a/1LZcCaWEry8WIo3GvN6HZThF/Bkps9RJLOfQ2PUjttpFvXE3UcxXFvk1xOJitswrBYgkpSsW4TfmLrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b37c575b7ea1015f8f20281448531e21f2148ef3b1001c9044802876c05ff816","last_reissued_at":"2026-05-18T01:32:42.788952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.788952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05586","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:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dwq4mt1tAqVxg5razG+GJNHOnkJ+PB06O2Xj6sjYIL1NLLvVyLMFMYJ8kL5CDKc+BZ35p0h3Yiaz0UQo5MABBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:05:43.262651Z"},"content_sha256":"de9b7b334612907df647d1733cda7cd956fe2343aecd22d2a7091854133205ac","schema_version":"1.0","event_id":"sha256:de9b7b334612907df647d1733cda7cd956fe2343aecd22d2a7091854133205ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WN6FOW36UEAV7DZAFAKEQUY6EH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ear-decompositions and the complexity of the matching polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Andr\\'as Seb\\H{o}, Yohann Benchetrit","submitted_at":"2015-09-18T10:55:58Z","abstract_excerpt":"The complexity of the matching polytope of graphs may be measured with the maximum length $\\beta$ of a starting sequence of odd ears in an ear-decomposition. Indeed, a theorem of Edmonds and Pulleyblank shows that its facets are defined by 2-connected factor-critical graphs, which have an odd ear-decomposition (according to a theorem of Lov\\'asz). In particular, $\\beta(G) \\leq 1$ if and only if the matching polytope of the graph $G$ is completely described by non-negativity, star and odd-circuit inequalities. This is essentially equivalent to the h-perfection of the line-graph of $G$, as obser"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05586","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:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RX9X/CYBpEKfQg0uNeepm0E5QrTS8xY8uqmtxUMky0kSk8MgmbyAXhKMpLNE5MI05yYZABRNPznQXQrS9sShDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:05:43.263005Z"},"content_sha256":"39565211fa41b76abaf023d89fcb74f096075e4080e8a27d21e95fd39816df0e","schema_version":"1.0","event_id":"sha256:39565211fa41b76abaf023d89fcb74f096075e4080e8a27d21e95fd39816df0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WN6FOW36UEAV7DZAFAKEQUY6EH/bundle.json","state_url":"https://pith.science/pith/WN6FOW36UEAV7DZAFAKEQUY6EH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WN6FOW36UEAV7DZAFAKEQUY6EH/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-03T13:05:43Z","links":{"resolver":"https://pith.science/pith/WN6FOW36UEAV7DZAFAKEQUY6EH","bundle":"https://pith.science/pith/WN6FOW36UEAV7DZAFAKEQUY6EH/bundle.json","state":"https://pith.science/pith/WN6FOW36UEAV7DZAFAKEQUY6EH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WN6FOW36UEAV7DZAFAKEQUY6EH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WN6FOW36UEAV7DZAFAKEQUY6EH","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":"6e88832f7eca894b5333449688f9cc8756b2c71cff6f5453e7e098ab88ef85f6","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T10:55:58Z","title_canon_sha256":"372f651f13d8c7c19f610f5a7bbc7f6f7ecf5e09f943012b051abe789d3deabe"},"schema_version":"1.0","source":{"id":"1509.05586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05586","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05586v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05586","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"WN6FOW36UEAV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WN6FOW36UEAV7DZA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WN6FOW36","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:39565211fa41b76abaf023d89fcb74f096075e4080e8a27d21e95fd39816df0e","target":"graph","created_at":"2026-05-18T01:32:42Z","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 complexity of the matching polytope of graphs may be measured with the maximum length $\\beta$ of a starting sequence of odd ears in an ear-decomposition. Indeed, a theorem of Edmonds and Pulleyblank shows that its facets are defined by 2-connected factor-critical graphs, which have an odd ear-decomposition (according to a theorem of Lov\\'asz). In particular, $\\beta(G) \\leq 1$ if and only if the matching polytope of the graph $G$ is completely described by non-negativity, star and odd-circuit inequalities. This is essentially equivalent to the h-perfection of the line-graph of $G$, as obser","authors_text":"Andr\\'as Seb\\H{o}, Yohann Benchetrit","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T10:55:58Z","title":"Ear-decompositions and the complexity of the matching polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05586","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:de9b7b334612907df647d1733cda7cd956fe2343aecd22d2a7091854133205ac","target":"record","created_at":"2026-05-18T01:32:42Z","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":"6e88832f7eca894b5333449688f9cc8756b2c71cff6f5453e7e098ab88ef85f6","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T10:55:58Z","title_canon_sha256":"372f651f13d8c7c19f610f5a7bbc7f6f7ecf5e09f943012b051abe789d3deabe"},"schema_version":"1.0","source":{"id":"1509.05586","kind":"arxiv","version":1}},"canonical_sha256":"b37c575b7ea1015f8f20281448531e21f2148ef3b1001c9044802876c05ff816","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b37c575b7ea1015f8f20281448531e21f2148ef3b1001c9044802876c05ff816","first_computed_at":"2026-05-18T01:32:42.788952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.788952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"of/4a/1LZcCaWEry8WIo3GvN6HZThF/Bkps9RJLOfQ2PUjttpFvXE3UcxXFvk1xOJitswrBYgkpSsW4TfmLrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.789427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de9b7b334612907df647d1733cda7cd956fe2343aecd22d2a7091854133205ac","sha256:39565211fa41b76abaf023d89fcb74f096075e4080e8a27d21e95fd39816df0e"],"state_sha256":"d51d12169cac59effc7fa7c5ebec8cc3570a072d50cdaadb09d2ec2598e999ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yz4jBq4LvghpBNVEso2Irn8LBKS3UFw5vNxvB1Meau9E0I4BtCzclOLSjz0X5mahZHngOSifF/c/Zc+/pPKqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:05:43.265007Z","bundle_sha256":"586fb9df092fab3ff5c1808ba52f76c267921e82d82560b5029cc4d8e920880a"}}