{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:74RRQRQ74BV2YQ3RFURQPCRIXA","short_pith_number":"pith:74RRQRQ7","schema_version":"1.0","canonical_sha256":"ff2318461fe06bac43712d23078a28b8250984647bf9519468158e19b0d35e95","source":{"kind":"arxiv","id":"2410.20692","version":1},"attestation_state":"computed","paper":{"title":"Planar wheel-like bricks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Jinxin Xue","submitted_at":"2024-10-28T02:52:09Z","abstract_excerpt":"An edge e in a matching covered graph G is removable if G-e is matching covered; a pair {e; f} of edges of 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, which was introduced by Lovasz and Plummer in connection with ear decompositions of matching covered graphs. A brick is a nonbipartite matching covered graph without nontrivial tight cuts. A brick G is wheel-like if G has a vertex h, such that every removable class of G has an edge incident with h. Lucchesi and Murty conjectured that e"},"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":"2410.20692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-28T02:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"dd879bef6be2a56ddb578acc30cbad55c270d303d1804b2f9c3f9d80e561b557","abstract_canon_sha256":"7316eae4ea66dff728a0fb78514e1754069a6a1e4494476eef7092f08522b97e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:09.498655Z","signature_b64":"Gppu2syqnBzQ4UzgiBPlNWhocLpjts6mFdTL9/prsuvm3sjRIQ5qtN6U4cmNfju1DUIqRb4VIszTmD7tmOvlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2318461fe06bac43712d23078a28b8250984647bf9519468158e19b0d35e95","last_reissued_at":"2026-07-05T09:27:09.498130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:09.498130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar wheel-like bricks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Jinxin Xue","submitted_at":"2024-10-28T02:52:09Z","abstract_excerpt":"An edge e in a matching covered graph G is removable if G-e is matching covered; a pair {e; f} of edges of 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, which was introduced by Lovasz and Plummer in connection with ear decompositions of matching covered graphs. A brick is a nonbipartite matching covered graph without nontrivial tight cuts. A brick G is wheel-like if G has a vertex h, such that every removable class of G has an edge incident with h. Lucchesi and Murty conjectured that e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20692","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/2410.20692/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":"2410.20692","created_at":"2026-07-05T09:27:09.498211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20692v1","created_at":"2026-07-05T09:27:09.498211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20692","created_at":"2026-07-05T09:27:09.498211+00:00"},{"alias_kind":"pith_short_12","alias_value":"74RRQRQ74BV2","created_at":"2026-07-05T09:27:09.498211+00:00"},{"alias_kind":"pith_short_16","alias_value":"74RRQRQ74BV2YQ3R","created_at":"2026-07-05T09:27:09.498211+00:00"},{"alias_kind":"pith_short_8","alias_value":"74RRQRQ7","created_at":"2026-07-05T09:27:09.498211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.16465","citing_title":"Wheel-like bricks and minimal matching covered graphs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA","json":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA.json","graph_json":"https://pith.science/api/pith-number/74RRQRQ74BV2YQ3RFURQPCRIXA/graph.json","events_json":"https://pith.science/api/pith-number/74RRQRQ74BV2YQ3RFURQPCRIXA/events.json","paper":"https://pith.science/paper/74RRQRQ7"},"agent_actions":{"view_html":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA","download_json":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA.json","view_paper":"https://pith.science/paper/74RRQRQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20692&json=true","fetch_graph":"https://pith.science/api/pith-number/74RRQRQ74BV2YQ3RFURQPCRIXA/graph.json","fetch_events":"https://pith.science/api/pith-number/74RRQRQ74BV2YQ3RFURQPCRIXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA/action/storage_attestation","attest_author":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA/action/author_attestation","sign_citation":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA/action/citation_signature","submit_replication":"https://pith.science/pith/74RRQRQ74BV2YQ3RFURQPCRIXA/action/replication_record"}},"created_at":"2026-07-05T09:27:09.498211+00:00","updated_at":"2026-07-05T09:27:09.498211+00:00"}