{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LTPEW6TJNYITYO7VGLZQL3FUHV","short_pith_number":"pith:LTPEW6TJ","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"},"canonical_sha256":"5cde4b7a696e113c3bf532f305ecb43d5a823eca894fe0e92bf425b6fd7be472","source":{"kind":"arxiv","id":"1902.01322","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01322","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01322v3","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01322","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"LTPEW6TJNYIT","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LTPEW6TJNYITYO7V","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LTPEW6TJ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LTPEW6TJNYITYO7VGLZQL3FUHV","target":"record","payload":{"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"},"canonical_sha256":"5cde4b7a696e113c3bf532f305ecb43d5a823eca894fe0e92bf425b6fd7be472","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"},"source_kind":"arxiv","source_id":"1902.01322","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNi+974Fg3z6fHeX547PnpAmAqNBBVCFqX8WKJ98bZs7FyDowDhPN4whO166ua5PBZb6LbM0TpoDq1PtkLeFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:18:06.967449Z"},"content_sha256":"4ee962f592cb367558aaa2966a1cf70dd052b61f15534fd990c9a89cbbb7cd78","schema_version":"1.0","event_id":"sha256:4ee962f592cb367558aaa2966a1cf70dd052b61f15534fd990c9a89cbbb7cd78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LTPEW6TJNYITYO7VGLZQL3FUHV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKVz3KuarsCa7ceNQWZml+LUBOSYzINfjPjXtDrMqb1mZLD+QOnzt2N5dMidyhmE4LJazMJLgu9jn0pnqH33Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:18:06.967808Z"},"content_sha256":"4a6358423f3f4fd092ff132483623bef76a4c7985e22cb0733429b30109ef055","schema_version":"1.0","event_id":"sha256:4a6358423f3f4fd092ff132483623bef76a4c7985e22cb0733429b30109ef055"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/bundle.json","state_url":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T10:18:06Z","links":{"resolver":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV","bundle":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/bundle.json","state":"https://pith.science/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTPEW6TJNYITYO7VGLZQL3FUHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LTPEW6TJNYITYO7VGLZQL3FUHV","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":"dca502cd99c02d3ba2e80e31f97a7db238478748403fcc7447ddb02c0733e7c3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T17:18:50Z","title_canon_sha256":"1b28ffcd5fb48fc16d72095cb4453fcde7628db806c2597ed3095d19b9d8e73d"},"schema_version":"1.0","source":{"id":"1902.01322","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01322","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01322v3","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01322","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"LTPEW6TJNYIT","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LTPEW6TJNYITYO7V","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LTPEW6TJ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:4a6358423f3f4fd092ff132483623bef76a4c7985e22cb0733429b30109ef055","target":"graph","created_at":"2026-05-17T23:54:02Z","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"},"paper":{"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","authors_text":"Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T17:18:50Z","title":"Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01322","kind":"arxiv","version":3},"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:4ee962f592cb367558aaa2966a1cf70dd052b61f15534fd990c9a89cbbb7cd78","target":"record","created_at":"2026-05-17T23:54:02Z","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":"dca502cd99c02d3ba2e80e31f97a7db238478748403fcc7447ddb02c0733e7c3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T17:18:50Z","title_canon_sha256":"1b28ffcd5fb48fc16d72095cb4453fcde7628db806c2597ed3095d19b9d8e73d"},"schema_version":"1.0","source":{"id":"1902.01322","kind":"arxiv","version":3}},"canonical_sha256":"5cde4b7a696e113c3bf532f305ecb43d5a823eca894fe0e92bf425b6fd7be472","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cde4b7a696e113c3bf532f305ecb43d5a823eca894fe0e92bf425b6fd7be472","first_computed_at":"2026-05-17T23:54:02.119945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:02.119945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oLRkynlHEJ1iYAUtL47fsByin1GESEMXz8d2TaCAHkoJ570AhsSK+08WEEY0jlNX3PxeKQy/1ikm1HUtZbe0CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:02.120492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01322","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ee962f592cb367558aaa2966a1cf70dd052b61f15534fd990c9a89cbbb7cd78","sha256:4a6358423f3f4fd092ff132483623bef76a4c7985e22cb0733429b30109ef055"],"state_sha256":"caaab408344cd3d11eb6dc60f4ed5d5e15c755c3d883990184173355a177e4ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixtWJDhK3ldmTzoS6XAv/hImZ70M5LDwUAJLGIYAk7NEnrvtB3nEIvFn0D+bD7STEL9ixxf+Q0PBNF0A2mEXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T10:18:06.969498Z","bundle_sha256":"42a0b3f1251f9e731fae0a21df832cf165526a52ec59e00bd2416cc133e57f32"}}