{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:V5DKWPCD25QC3VS6Q63BABKVBK","short_pith_number":"pith:V5DKWPCD","schema_version":"1.0","canonical_sha256":"af46ab3c43d7602dd65e87b61005550ab37df9acffa96596699b1dbbe6767a7b","source":{"kind":"arxiv","id":"2411.17295","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.17295","created_at":"2026-07-05T09:40:30.150529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17295v1","created_at":"2026-07-05T09:40:30.150529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17295","created_at":"2026-07-05T09:40:30.150529+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5DKWPCD25QC","created_at":"2026-07-05T09:40:30.150529+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5DKWPCD25QC3VS6","created_at":"2026-07-05T09:40:30.150529+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5DKWPCD","created_at":"2026-07-05T09:40:30.150529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00608","citing_title":"Near-bipartite bricks in which every b-invariant edge is a forcing edge","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK","json":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK.json","graph_json":"https://pith.science/api/pith-number/V5DKWPCD25QC3VS6Q63BABKVBK/graph.json","events_json":"https://pith.science/api/pith-number/V5DKWPCD25QC3VS6Q63BABKVBK/events.json","paper":"https://pith.science/paper/V5DKWPCD"},"agent_actions":{"view_html":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK","download_json":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK.json","view_paper":"https://pith.science/paper/V5DKWPCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17295&json=true","fetch_graph":"https://pith.science/api/pith-number/V5DKWPCD25QC3VS6Q63BABKVBK/graph.json","fetch_events":"https://pith.science/api/pith-number/V5DKWPCD25QC3VS6Q63BABKVBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/action/storage_attestation","attest_author":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/action/author_attestation","sign_citation":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/action/citation_signature","submit_replication":"https://pith.science/pith/V5DKWPCD25QC3VS6Q63BABKVBK/action/replication_record"}},"created_at":"2026-07-05T09:40:30.150529+00:00","updated_at":"2026-07-05T09:40:30.150529+00:00"}