{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:V5DKWPCD25QC3VS6Q63BABKVBK","short_pith_number":"pith:V5DKWPCD","canonical_record":{"source":{"id":"2411.17295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T10:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"15842a0714365169d730e5ca22a7e62228382c325bb9947c241edb2274af407c","abstract_canon_sha256":"dbad6455b61b2029e76f7a546da67316a6d214a9538ca27be39d83b774d1042e"},"schema_version":"1.0"},"canonical_sha256":"af46ab3c43d7602dd65e87b61005550ab37df9acffa96596699b1dbbe6767a7b","source":{"kind":"arxiv","id":"2411.17295","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17295","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17295v1","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17295","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_12","alias_value":"V5DKWPCD25QC","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_16","alias_value":"V5DKWPCD25QC3VS6","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_8","alias_value":"V5DKWPCD","created_at":"2026-07-05T09:40:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:V5DKWPCD25QC3VS6Q63BABKVBK","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T10:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"15842a0714365169d730e5ca22a7e62228382c325bb9947c241edb2274af407c","abstract_canon_sha256":"dbad6455b61b2029e76f7a546da67316a6d214a9538ca27be39d83b774d1042e"},"schema_version":"1.0"},"canonical_sha256":"af46ab3c43d7602dd65e87b61005550ab37df9acffa96596699b1dbbe6767a7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:30.150912Z","signature_b64":"tAscElhU/7j4PsNGAUaWK5tKIUxjiWxSG9RsMEiGGnv0FqQ32xW1Y4POkUKQIilFaH/fseQqVEPrBTyPGvoLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af46ab3c43d7602dd65e87b61005550ab37df9acffa96596699b1dbbe6767a7b","last_reissued_at":"2026-07-05T09:40:30.150472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:30.150472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17295","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-07-05T09:40:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qOawO+icF0hGgmE2p95AHXzkkioVqJS9yMsZkdnC9Tvm+ZCqhqyMGaAw52FKmf0PF95cdvwaOdKZ4zAxt4lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:02:26.377742Z"},"content_sha256":"dbc4178dd249cbfc5ad67e0ef7d864c8a22328ba72d86b04045e7a04711dd8bb","schema_version":"1.0","event_id":"sha256:dbc4178dd249cbfc5ad67e0ef7d864c8a22328ba72d86b04045e7a04711dd8bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:V5DKWPCD25QC3VS6Q63BABKVBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cubic bricks that every b-invariant edge is forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Heping Zhang, Yaxian Zhang","submitted_at":"2024-11-26T10:37:09Z","abstract_excerpt":"A connected graph G is matching covered if every edge lies in some perfect matching of G. Lovasz proved that every matching covered graph G can be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite) up to multiple edges. Denote by b(G) the number of bricks of G. An edge e of G is removable if G-e is also matching covered, and solitary (or forcing) if after the removal of the two end vertices of e, the left graph has a unique perfect matching. Furthermore, a removable edge e of a brick G is b-invariant if b(G-e) = 1.\n  Lucchesi and Murty proposed a problem of charact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17295","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17295/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-05T09:40:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VANM4n28mN/NQaiO0/0ec2bROvkRB0IQB99TYhPl1e8/mh/SAh2TPEI+D8vrbZ/NvXyDmSwf8yCGsGXBICv1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:02:26.378112Z"},"content_sha256":"a8ea4489ac6d5e0f0295865db99166cadf05c4332688055db37acf68bdf59bd7","schema_version":"1.0","event_id":"sha256:a8ea4489ac6d5e0f0295865db99166cadf05c4332688055db37acf68bdf59bd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/bundle.json","state_url":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5DKWPCD25QC3VS6Q63BABKVBK/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-07-07T11:02:26Z","links":{"resolver":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK","bundle":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/bundle.json","state":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5DKWPCD25QC3VS6Q63BABKVBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:V5DKWPCD25QC3VS6Q63BABKVBK","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":"dbad6455b61b2029e76f7a546da67316a6d214a9538ca27be39d83b774d1042e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T10:37:09Z","title_canon_sha256":"15842a0714365169d730e5ca22a7e62228382c325bb9947c241edb2274af407c"},"schema_version":"1.0","source":{"id":"2411.17295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17295","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17295v1","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17295","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_12","alias_value":"V5DKWPCD25QC","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_16","alias_value":"V5DKWPCD25QC3VS6","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_8","alias_value":"V5DKWPCD","created_at":"2026-07-05T09:40:30Z"}],"graph_snapshots":[{"event_id":"sha256:a8ea4489ac6d5e0f0295865db99166cadf05c4332688055db37acf68bdf59bd7","target":"graph","created_at":"2026-07-05T09:40:30Z","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/2411.17295/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A connected graph G is matching covered if every edge lies in some perfect matching of G. Lovasz proved that every matching covered graph G can be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite) up to multiple edges. Denote by b(G) the number of bricks of G. An edge e of G is removable if G-e is also matching covered, and solitary (or forcing) if after the removal of the two end vertices of e, the left graph has a unique perfect matching. Furthermore, a removable edge e of a brick G is b-invariant if b(G-e) = 1.\n  Lucchesi and Murty proposed a problem of charact","authors_text":"Fuliang Lu, Heping Zhang, Yaxian Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T10:37:09Z","title":"Cubic bricks that every b-invariant edge is forcing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17295","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:dbc4178dd249cbfc5ad67e0ef7d864c8a22328ba72d86b04045e7a04711dd8bb","target":"record","created_at":"2026-07-05T09:40:30Z","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":"dbad6455b61b2029e76f7a546da67316a6d214a9538ca27be39d83b774d1042e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T10:37:09Z","title_canon_sha256":"15842a0714365169d730e5ca22a7e62228382c325bb9947c241edb2274af407c"},"schema_version":"1.0","source":{"id":"2411.17295","kind":"arxiv","version":1}},"canonical_sha256":"af46ab3c43d7602dd65e87b61005550ab37df9acffa96596699b1dbbe6767a7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af46ab3c43d7602dd65e87b61005550ab37df9acffa96596699b1dbbe6767a7b","first_computed_at":"2026-07-05T09:40:30.150472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:30.150472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tAscElhU/7j4PsNGAUaWK5tKIUxjiWxSG9RsMEiGGnv0FqQ32xW1Y4POkUKQIilFaH/fseQqVEPrBTyPGvoLCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:30.150912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbc4178dd249cbfc5ad67e0ef7d864c8a22328ba72d86b04045e7a04711dd8bb","sha256:a8ea4489ac6d5e0f0295865db99166cadf05c4332688055db37acf68bdf59bd7"],"state_sha256":"83eca0b90014bf31c1d7abc0d9c93e70b2ac39bf0b45702cd8b038c048608e82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6WfTMQZuZKoAD04eBcquT5NvXlDGHTh1odFWBFeMB+v56OWScnLgW+xCHFg5DbExOLpBSBy6q4H9BQZZXiMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:02:26.380101Z","bundle_sha256":"9ce11ac24b0ec0f64570429d3e27011b0e32239ba9211e43808a60c4471f3e5d"}}