{"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"}