{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:D4VBOAA2JEF73C3DBZ4JW6FLKU","short_pith_number":"pith:D4VBOAA2","canonical_record":{"source":{"id":"2412.16465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-21T03:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"f4b197101213b1540ce51158aff2c8d13de01dc94821f19b63cf72a38b38a3a7","abstract_canon_sha256":"27b689a561c64e39dfe014fa5dbc87e6834b282a6f326fea35a8e9297e21ea4a"},"schema_version":"1.0"},"canonical_sha256":"1f2a17001a490bfd8b630e789b78ab553edc7a60d9e540b45911c7474314a4f5","source":{"kind":"arxiv","id":"2412.16465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.16465","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2412.16465v2","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16465","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"D4VBOAA2JEF7","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"D4VBOAA2JEF73C3D","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"D4VBOAA2","created_at":"2026-07-05T11:13:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:D4VBOAA2JEF73C3DBZ4JW6FLKU","target":"record","payload":{"canonical_record":{"source":{"id":"2412.16465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-21T03:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"f4b197101213b1540ce51158aff2c8d13de01dc94821f19b63cf72a38b38a3a7","abstract_canon_sha256":"27b689a561c64e39dfe014fa5dbc87e6834b282a6f326fea35a8e9297e21ea4a"},"schema_version":"1.0"},"canonical_sha256":"1f2a17001a490bfd8b630e789b78ab553edc7a60d9e540b45911c7474314a4f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:17.428017Z","signature_b64":"X8jgNAFVZHHZJhJF/r5Y7MGZji+2SzK0OHhwvynZFj0KuP2/BqKt1vm5vuYM4gnVu4XTf4MRPL0zbATVdpalDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f2a17001a490bfd8b630e789b78ab553edc7a60d9e540b45911c7474314a4f5","last_reissued_at":"2026-07-05T11:13:17.427534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:17.427534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.16465","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-07-05T11:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfybJljcWBkpW8qq1BcJON3nHnRcv/vVritaJy+8063Yd/kjFNFHz/vBP8HP88vgrc9j3MnQaP4J6s79R+BPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:51:44.370888Z"},"content_sha256":"941f9136ed2571e68a51d66dc03a46cc59b4eae8a06f4b343e104dd881d6821d","schema_version":"1.0","event_id":"sha256:941f9136ed2571e68a51d66dc03a46cc59b4eae8a06f4b343e104dd881d6821d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:D4VBOAA2JEF73C3DBZ4JW6FLKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wheel-like bricks and minimal matching covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Jinxin Xue, Xiaoling He","submitted_at":"2024-12-21T03:42:44Z","abstract_excerpt":"A connected graph G with at least two vertices is matching covered if each of its edges lies in a perfect matching. We say that an edge e in a matching covered graph G is removable if G-e is matching covered. A pair {e; f} of edges of a matching covered graph G is a removable doubleton if G-e-f is matching covered, but neither G-e nor G-f is. Removable edges and removable doubletons are called removable classes, introduced by Lovasz and Plummer in connection with ear decompositions of matching covered graphs. A 3-connected graph is a brick if the removal of any two distinct vertices, the left "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.16465/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uv+wGekgzrdVvUEsg59sArjy4RG9NkJU1+1n3XYs3vwGS8AhZb5mooG8ygbroMz2svRT/XRLRPRK9pl1PRy1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:51:44.371664Z"},"content_sha256":"0b05694fecc24410213a3905344c8dbf54ec6726b773249c23a92f7d6d07649f","schema_version":"1.0","event_id":"sha256:0b05694fecc24410213a3905344c8dbf54ec6726b773249c23a92f7d6d07649f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/bundle.json","state_url":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/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-08-20T21:51:44Z","links":{"resolver":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU","bundle":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/bundle.json","state":"https://pith.science/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4VBOAA2JEF73C3DBZ4JW6FLKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:D4VBOAA2JEF73C3DBZ4JW6FLKU","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":"27b689a561c64e39dfe014fa5dbc87e6834b282a6f326fea35a8e9297e21ea4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-21T03:42:44Z","title_canon_sha256":"f4b197101213b1540ce51158aff2c8d13de01dc94821f19b63cf72a38b38a3a7"},"schema_version":"1.0","source":{"id":"2412.16465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.16465","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2412.16465v2","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16465","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"D4VBOAA2JEF7","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"D4VBOAA2JEF73C3D","created_at":"2026-07-05T11:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"D4VBOAA2","created_at":"2026-07-05T11:13:17Z"}],"graph_snapshots":[{"event_id":"sha256:0b05694fecc24410213a3905344c8dbf54ec6726b773249c23a92f7d6d07649f","target":"graph","created_at":"2026-07-05T11:13:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.16465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A connected graph G with at least two vertices is matching covered if each of its edges lies in a perfect matching. We say that an edge e in a matching covered graph G is removable if G-e is matching covered. A pair {e; f} of edges of a matching covered graph G is a removable doubleton if G-e-f is matching covered, but neither G-e nor G-f is. Removable edges and removable doubletons are called removable classes, introduced by Lovasz and Plummer in connection with ear decompositions of matching covered graphs. A 3-connected graph is a brick if the removal of any two distinct vertices, the left ","authors_text":"Fuliang Lu, Jinxin Xue, Xiaoling He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-21T03:42:44Z","title":"Wheel-like bricks and minimal matching covered graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16465","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:941f9136ed2571e68a51d66dc03a46cc59b4eae8a06f4b343e104dd881d6821d","target":"record","created_at":"2026-07-05T11:13:17Z","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":"27b689a561c64e39dfe014fa5dbc87e6834b282a6f326fea35a8e9297e21ea4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-21T03:42:44Z","title_canon_sha256":"f4b197101213b1540ce51158aff2c8d13de01dc94821f19b63cf72a38b38a3a7"},"schema_version":"1.0","source":{"id":"2412.16465","kind":"arxiv","version":2}},"canonical_sha256":"1f2a17001a490bfd8b630e789b78ab553edc7a60d9e540b45911c7474314a4f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f2a17001a490bfd8b630e789b78ab553edc7a60d9e540b45911c7474314a4f5","first_computed_at":"2026-07-05T11:13:17.427534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:17.427534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X8jgNAFVZHHZJhJF/r5Y7MGZji+2SzK0OHhwvynZFj0KuP2/BqKt1vm5vuYM4gnVu4XTf4MRPL0zbATVdpalDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:17.428017Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.16465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:941f9136ed2571e68a51d66dc03a46cc59b4eae8a06f4b343e104dd881d6821d","sha256:0b05694fecc24410213a3905344c8dbf54ec6726b773249c23a92f7d6d07649f"],"state_sha256":"4f27a9d520536937e65927cb1a066785ce4198bf441f177b15ceaec872a8b0b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"olRalINUqu/xy6JSOwzMcFTXABj2Xf00/EAfDLNQKsqREh8GddcRgnTN4u0bVAlRbE0QiaPfoEWLS8zcELc/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T21:51:44.376363Z","bundle_sha256":"1bfa18ccb4ea0341730b99839bd0286f3e0a472f863dad8486158ec23b61d60d"}}