{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UDUBQXKYKG47ET5AC54EWN723E","short_pith_number":"pith:UDUBQXKY","canonical_record":{"source":{"id":"1904.03881","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-08T08:17:01Z","cross_cats_sorted":[],"title_canon_sha256":"50c2574319d5c98ffa229c7d9a62f5cd5ffcc693bcf00a311bb6391ed5bccb0e","abstract_canon_sha256":"3d742dbe79767184792d9ee444389a000110aa9ee6039a19c8ad60620680ef28"},"schema_version":"1.0"},"canonical_sha256":"a0e8185d5851b9f24fa017784b37fad927381d17de6df5017aaa904d6c0d49b9","source":{"kind":"arxiv","id":"1904.03881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03881","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03881v1","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03881","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"pith_short_12","alias_value":"UDUBQXKYKG47","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UDUBQXKYKG47ET5A","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UDUBQXKY","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UDUBQXKYKG47ET5AC54EWN723E","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03881","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-08T08:17:01Z","cross_cats_sorted":[],"title_canon_sha256":"50c2574319d5c98ffa229c7d9a62f5cd5ffcc693bcf00a311bb6391ed5bccb0e","abstract_canon_sha256":"3d742dbe79767184792d9ee444389a000110aa9ee6039a19c8ad60620680ef28"},"schema_version":"1.0"},"canonical_sha256":"a0e8185d5851b9f24fa017784b37fad927381d17de6df5017aaa904d6c0d49b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:07.839298Z","signature_b64":"sNvz2HrKee+wKpQ8WeIqn0G7pLW1YkcpKaE/LF+1p/BZFtQmIGWYuGVlSyKvrvKlOzMtpHI+AJKVLIZsemFWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0e8185d5851b9f24fa017784b37fad927381d17de6df5017aaa904d6c0d49b9","last_reissued_at":"2026-05-17T23:49:07.838693Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:07.838693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03881","source_version":1,"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:49:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOHAPBAxDibDHTdLM1g9R0re/+oNcJNqTAOyBeJ5abbzrqMSOI2GEtR40VGIZQSJJ53kqp5MZuLudfOTW6kVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:52:13.793802Z"},"content_sha256":"d6e70a1dbc41f4590256dd9b41599bc1f06e8e8ae8fba63d218799bc5836ab20","schema_version":"1.0","event_id":"sha256:d6e70a1dbc41f4590256dd9b41599bc1f06e8e8ae8fba63d218799bc5836ab20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UDUBQXKYKG47ET5AC54EWN723E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The cubical matching complex revisited","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Du\\v{s}ko Joji\\'c","submitted_at":"2019-04-08T08:17:01Z","abstract_excerpt":"Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the union of collapsible complexes. Also, we prove that all links in these complexes are suspensions up to homotopy. Furthermore, we extend the definition of a cubical matching complex to planar graphs that are not necessarily bipartite, and show that these complexes are either contractible or a disjoint union of contractible complexes.\n  For a simple connected regi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03881","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":""},"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:49:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X74YpY/stG0OvaiirB+RsvK5sg17UzO6dtkEOtvAq86ayXjh9TFtuFawwsA3ZR+dcspc0XJ/6zTL7ZoFghOtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:52:13.794131Z"},"content_sha256":"dacc45f7b7c64240fbabd948c5a91ccd897b183d85e70939ed85c3e0e4f94d8c","schema_version":"1.0","event_id":"sha256:dacc45f7b7c64240fbabd948c5a91ccd897b183d85e70939ed85c3e0e4f94d8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDUBQXKYKG47ET5AC54EWN723E/bundle.json","state_url":"https://pith.science/pith/UDUBQXKYKG47ET5AC54EWN723E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDUBQXKYKG47ET5AC54EWN723E/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-06-27T00:52:13Z","links":{"resolver":"https://pith.science/pith/UDUBQXKYKG47ET5AC54EWN723E","bundle":"https://pith.science/pith/UDUBQXKYKG47ET5AC54EWN723E/bundle.json","state":"https://pith.science/pith/UDUBQXKYKG47ET5AC54EWN723E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDUBQXKYKG47ET5AC54EWN723E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UDUBQXKYKG47ET5AC54EWN723E","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":"3d742dbe79767184792d9ee444389a000110aa9ee6039a19c8ad60620680ef28","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-08T08:17:01Z","title_canon_sha256":"50c2574319d5c98ffa229c7d9a62f5cd5ffcc693bcf00a311bb6391ed5bccb0e"},"schema_version":"1.0","source":{"id":"1904.03881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03881","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03881v1","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03881","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"pith_short_12","alias_value":"UDUBQXKYKG47","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UDUBQXKYKG47ET5A","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UDUBQXKY","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:dacc45f7b7c64240fbabd948c5a91ccd897b183d85e70939ed85c3e0e4f94d8c","target":"graph","created_at":"2026-05-17T23:49:07Z","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":"Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the union of collapsible complexes. Also, we prove that all links in these complexes are suspensions up to homotopy. Furthermore, we extend the definition of a cubical matching complex to planar graphs that are not necessarily bipartite, and show that these complexes are either contractible or a disjoint union of contractible complexes.\n  For a simple connected regi","authors_text":"Du\\v{s}ko Joji\\'c","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-08T08:17:01Z","title":"The cubical matching complex revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03881","kind":"arxiv","version":1},"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:d6e70a1dbc41f4590256dd9b41599bc1f06e8e8ae8fba63d218799bc5836ab20","target":"record","created_at":"2026-05-17T23:49:07Z","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":"3d742dbe79767184792d9ee444389a000110aa9ee6039a19c8ad60620680ef28","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-04-08T08:17:01Z","title_canon_sha256":"50c2574319d5c98ffa229c7d9a62f5cd5ffcc693bcf00a311bb6391ed5bccb0e"},"schema_version":"1.0","source":{"id":"1904.03881","kind":"arxiv","version":1}},"canonical_sha256":"a0e8185d5851b9f24fa017784b37fad927381d17de6df5017aaa904d6c0d49b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0e8185d5851b9f24fa017784b37fad927381d17de6df5017aaa904d6c0d49b9","first_computed_at":"2026-05-17T23:49:07.838693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:07.838693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sNvz2HrKee+wKpQ8WeIqn0G7pLW1YkcpKaE/LF+1p/BZFtQmIGWYuGVlSyKvrvKlOzMtpHI+AJKVLIZsemFWDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:07.839298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6e70a1dbc41f4590256dd9b41599bc1f06e8e8ae8fba63d218799bc5836ab20","sha256:dacc45f7b7c64240fbabd948c5a91ccd897b183d85e70939ed85c3e0e4f94d8c"],"state_sha256":"2fffc26528dedd1619ad5422a2aa23714e1140ddac80cc313d37af9b920fd556"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f48he22q47wGjmBiHwPHfp5rw99h6laTm8V6A2H4rGV1roa/RLGxaBfAkJpqk6Odn6BXI5Flpg09uDqKVzTkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T00:52:13.795956Z","bundle_sha256":"76a16ca26fa50c844fde2a4bccf5820e38563b5c1b203412d1ebbb7833225990"}}