{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LTPEW6TJNYITYO7VGLZQL3FUHV","short_pith_number":"pith:LTPEW6TJ","schema_version":"1.0","canonical_sha256":"5cde4b7a696e113c3bf532f305ecb43d5a823eca894fe0e92bf425b6fd7be472","source":{"kind":"arxiv","id":"1902.01322","version":3},"attestation_state":"computed","paper":{"title":"Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht","submitted_at":"2019-02-04T17:18:50Z","abstract_excerpt":"A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and intended as a tool for the structural study of matching covered graphs, especially in the context of Pfaffian orientations. Norine conjectured that graphs of high perfect matching width would contain a large grid as a matching minor, similar to the result on treewidth by Robertson and Seymour. In this paper we obtain the first results on perfect matching widt"},"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":"1902.01322","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T17:18:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1b28ffcd5fb48fc16d72095cb4453fcde7628db806c2597ed3095d19b9d8e73d","abstract_canon_sha256":"dca502cd99c02d3ba2e80e31f97a7db238478748403fcc7447ddb02c0733e7c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:02.120492Z","signature_b64":"oLRkynlHEJ1iYAUtL47fsByin1GESEMXz8d2TaCAHkoJ570AhsSK+08WEEY0jlNX3PxeKQy/1ikm1HUtZbe0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cde4b7a696e113c3bf532f305ecb43d5a823eca894fe0e92bf425b6fd7be472","last_reissued_at":"2026-05-17T23:54:02.119945Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:02.119945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht","submitted_at":"2019-02-04T17:18:50Z","abstract_excerpt":"A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and intended as a tool for the structural study of matching covered graphs, especially in the context of Pfaffian orientations. Norine conjectured that graphs of high perfect matching width would contain a large grid as a matching minor, similar to the result on treewidth by Robertson and Seymour. In this paper we obtain the first results on perfect matching widt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01322","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1902.01322","created_at":"2026-05-17T23:54:02.120027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01322v3","created_at":"2026-05-17T23:54:02.120027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01322","created_at":"2026-05-17T23:54:02.120027+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTPEW6TJNYIT","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTPEW6TJNYITYO7V","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTPEW6TJ","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV","json":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV.json","graph_json":"https://pith.science/api/pith-number/LTPEW6TJNYITYO7VGLZQL3FUHV/graph.json","events_json":"https://pith.science/api/pith-number/LTPEW6TJNYITYO7VGLZQL3FUHV/events.json","paper":"https://pith.science/paper/LTPEW6TJ"},"agent_actions":{"view_html":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV","download_json":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV.json","view_paper":"https://pith.science/paper/LTPEW6TJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01322&json=true","fetch_graph":"https://pith.science/api/pith-number/LTPEW6TJNYITYO7VGLZQL3FUHV/graph.json","fetch_events":"https://pith.science/api/pith-number/LTPEW6TJNYITYO7VGLZQL3FUHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/action/storage_attestation","attest_author":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/action/author_attestation","sign_citation":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/action/citation_signature","submit_replication":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/action/replication_record"}},"created_at":"2026-05-17T23:54:02.120027+00:00","updated_at":"2026-05-17T23:54:02.120027+00:00"}