{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TGZO62PBLSIPHKD535HWHGNQS7","short_pith_number":"pith:TGZO62PB","schema_version":"1.0","canonical_sha256":"99b2ef69e15c90f3a87ddf4f6399b097edb67c2af24b98cd026de3611285074c","source":{"kind":"arxiv","id":"2606.26594","version":1},"attestation_state":"computed","paper":{"title":"Bricks in which every vertex is incident with a forcing edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Xinyu Dai, Yaxian Zhang","submitted_at":"2026-06-25T04:39:17Z","abstract_excerpt":"An edge of a matching covered graph G is a forcing edge if it lies in precisely one perfect matching of G. A matching covered graph is a brick if and only if it is 3-connected and bicritical (the deletion of each pair of distinct vertices results in a graph with a perfect matching). In this paper, we prove that every vertex of a brick is incident with a forcing edge if and only if the brick is an odd wheel up to multiple edges."},"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":"2606.26594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-25T04:39:17Z","cross_cats_sorted":[],"title_canon_sha256":"a639e8d3b790548221738cc2456a3028810bdec2e42989b60213440fb6198635","abstract_canon_sha256":"4c216d5c778922e612e637d9c894c1ca198c0bf66ef094e4d4c6695b940a3fca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:35.792531Z","signature_b64":"/++WHm/7N8uDykYgRZ3bRSmSFVsRhl2BupHNoUfUUKZtens2WixLEKQpiRvpBtOtLLVfn5E5KN4zYI3wVcfkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99b2ef69e15c90f3a87ddf4f6399b097edb67c2af24b98cd026de3611285074c","last_reissued_at":"2026-06-26T01:15:35.792178Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:35.792178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bricks in which every vertex is incident with a forcing edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Xinyu Dai, Yaxian Zhang","submitted_at":"2026-06-25T04:39:17Z","abstract_excerpt":"An edge of a matching covered graph G is a forcing edge if it lies in precisely one perfect matching of G. A matching covered graph is a brick if and only if it is 3-connected and bicritical (the deletion of each pair of distinct vertices results in a graph with a perfect matching). In this paper, we prove that every vertex of a brick is incident with a forcing edge if and only if the brick is an odd wheel up to multiple edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26594","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/2606.26594/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":"2606.26594","created_at":"2026-06-26T01:15:35.792236+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26594v1","created_at":"2026-06-26T01:15:35.792236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26594","created_at":"2026-06-26T01:15:35.792236+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGZO62PBLSIP","created_at":"2026-06-26T01:15:35.792236+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGZO62PBLSIPHKD5","created_at":"2026-06-26T01:15:35.792236+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGZO62PB","created_at":"2026-06-26T01:15:35.792236+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.12832","citing_title":"Bricks that every removable edge is solitary","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7","json":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7.json","graph_json":"https://pith.science/api/pith-number/TGZO62PBLSIPHKD535HWHGNQS7/graph.json","events_json":"https://pith.science/api/pith-number/TGZO62PBLSIPHKD535HWHGNQS7/events.json","paper":"https://pith.science/paper/TGZO62PB"},"agent_actions":{"view_html":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7","download_json":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7.json","view_paper":"https://pith.science/paper/TGZO62PB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26594&json=true","fetch_graph":"https://pith.science/api/pith-number/TGZO62PBLSIPHKD535HWHGNQS7/graph.json","fetch_events":"https://pith.science/api/pith-number/TGZO62PBLSIPHKD535HWHGNQS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7/action/storage_attestation","attest_author":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7/action/author_attestation","sign_citation":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7/action/citation_signature","submit_replication":"https://pith.science/pith/TGZO62PBLSIPHKD535HWHGNQS7/action/replication_record"}},"created_at":"2026-06-26T01:15:35.792236+00:00","updated_at":"2026-06-26T01:15:35.792236+00:00"}