{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4JXIFITJPS2X4JOVMGGXNZYLCJ","short_pith_number":"pith:4JXIFITJ","canonical_record":{"source":{"id":"2002.11818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-02-26T22:04:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8d4fd99b93b08761d5aa4aeae57b27539263317efb662762204d47c56bd22229","abstract_canon_sha256":"d9e0bdae67fc7ebcf8de33a130212e38865dccdb6d0ab98d127f7e1ab775375f"},"schema_version":"1.0"},"canonical_sha256":"e26e82a2697cb57e25d5618d76e70b12451c6a1eb58fd7bfade305a1b7b2ea18","source":{"kind":"arxiv","id":"2002.11818","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.11818","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"arxiv_version","alias_value":"2002.11818v2","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11818","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"pith_short_12","alias_value":"4JXIFITJPS2X","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"pith_short_16","alias_value":"4JXIFITJPS2X4JOV","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"pith_short_8","alias_value":"4JXIFITJ","created_at":"2026-07-05T00:49:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4JXIFITJPS2X4JOVMGGXNZYLCJ","target":"record","payload":{"canonical_record":{"source":{"id":"2002.11818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-02-26T22:04:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8d4fd99b93b08761d5aa4aeae57b27539263317efb662762204d47c56bd22229","abstract_canon_sha256":"d9e0bdae67fc7ebcf8de33a130212e38865dccdb6d0ab98d127f7e1ab775375f"},"schema_version":"1.0"},"canonical_sha256":"e26e82a2697cb57e25d5618d76e70b12451c6a1eb58fd7bfade305a1b7b2ea18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:49:01.657895Z","signature_b64":"CpizsMLIk5AL6mO9n3Xtpzih5cjDoB3YplSKXiP/JE9+7NkXN7RsbhsGDuYHIQpc3QDYwdtVmPsmDpjHKEVZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e26e82a2697cb57e25d5618d76e70b12451c6a1eb58fd7bfade305a1b7b2ea18","last_reissued_at":"2026-07-05T00:49:01.657518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:49:01.657518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.11818","source_version":2,"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-07-05T00:49:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EsENRByR/da3CLaW5DvL6b8cgTXJE+0hKqQ1xoJUATd28W4Dhgf1rjVjNUYMzuFRQCwMs+3IznoaGeReglP/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:14:39.258963Z"},"content_sha256":"49b01308a08232b06c60bea40d901dd2e167c2d3db42c0327de57c0fe9dc9a98","schema_version":"1.0","event_id":"sha256:49b01308a08232b06c60bea40d901dd2e167c2d3db42c0327de57c0fe9dc9a98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4JXIFITJPS2X4JOVMGGXNZYLCJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding large matchings in 1-planar graphs of minimum degree 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Fabian Klute, Therese Biedl","submitted_at":"2020-02-26T22:04:43Z","abstract_excerpt":"A matching is a set of edges without common endpoint. It was recently shown that every 1-planar graph (i.e., a graph that can be drawn in the plane with at most one crossing per edge) that has minimum degree 3 has a matching of size at least $\\frac{n+12}{7}$, and this is tight for some graphs. The proof did not come with an algorithm to find the matching more efficiently than a general-purpose maximum-matching algorithm. In this paper, we give such an algorithm. More generally, we show that any matching that has no augmenting paths of length 9 or less has size at least $\\frac{n+12}{7}$ in a 1-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11818","kind":"arxiv","version":2},"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/2002.11818/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"},"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-07-05T00:49:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9huJ116es82B/4Sh1IJ1a752GeFfalRmsgufJnuMsr9T8V6awB/yZNV9jATrVKKrASoEOqNSQvyt8MzlnjeXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:14:39.259539Z"},"content_sha256":"b5e4b6172ce93b34bc758e30ea6cfe94e1c767e44d399a5f6677a39d5b96c8c0","schema_version":"1.0","event_id":"sha256:b5e4b6172ce93b34bc758e30ea6cfe94e1c767e44d399a5f6677a39d5b96c8c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JXIFITJPS2X4JOVMGGXNZYLCJ/bundle.json","state_url":"https://pith.science/pith/4JXIFITJPS2X4JOVMGGXNZYLCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JXIFITJPS2X4JOVMGGXNZYLCJ/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-08-08T11:14:39Z","links":{"resolver":"https://pith.science/pith/4JXIFITJPS2X4JOVMGGXNZYLCJ","bundle":"https://pith.science/pith/4JXIFITJPS2X4JOVMGGXNZYLCJ/bundle.json","state":"https://pith.science/pith/4JXIFITJPS2X4JOVMGGXNZYLCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JXIFITJPS2X4JOVMGGXNZYLCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4JXIFITJPS2X4JOVMGGXNZYLCJ","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":"d9e0bdae67fc7ebcf8de33a130212e38865dccdb6d0ab98d127f7e1ab775375f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-02-26T22:04:43Z","title_canon_sha256":"8d4fd99b93b08761d5aa4aeae57b27539263317efb662762204d47c56bd22229"},"schema_version":"1.0","source":{"id":"2002.11818","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.11818","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"arxiv_version","alias_value":"2002.11818v2","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11818","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"pith_short_12","alias_value":"4JXIFITJPS2X","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"pith_short_16","alias_value":"4JXIFITJPS2X4JOV","created_at":"2026-07-05T00:49:01Z"},{"alias_kind":"pith_short_8","alias_value":"4JXIFITJ","created_at":"2026-07-05T00:49:01Z"}],"graph_snapshots":[{"event_id":"sha256:b5e4b6172ce93b34bc758e30ea6cfe94e1c767e44d399a5f6677a39d5b96c8c0","target":"graph","created_at":"2026-07-05T00:49:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.11818/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A matching is a set of edges without common endpoint. It was recently shown that every 1-planar graph (i.e., a graph that can be drawn in the plane with at most one crossing per edge) that has minimum degree 3 has a matching of size at least $\\frac{n+12}{7}$, and this is tight for some graphs. The proof did not come with an algorithm to find the matching more efficiently than a general-purpose maximum-matching algorithm. In this paper, we give such an algorithm. More generally, we show that any matching that has no augmenting paths of length 9 or less has size at least $\\frac{n+12}{7}$ in a 1-","authors_text":"Fabian Klute, Therese Biedl","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-02-26T22:04:43Z","title":"Finding large matchings in 1-planar graphs of minimum degree 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11818","kind":"arxiv","version":2},"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:49b01308a08232b06c60bea40d901dd2e167c2d3db42c0327de57c0fe9dc9a98","target":"record","created_at":"2026-07-05T00:49:01Z","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":"d9e0bdae67fc7ebcf8de33a130212e38865dccdb6d0ab98d127f7e1ab775375f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-02-26T22:04:43Z","title_canon_sha256":"8d4fd99b93b08761d5aa4aeae57b27539263317efb662762204d47c56bd22229"},"schema_version":"1.0","source":{"id":"2002.11818","kind":"arxiv","version":2}},"canonical_sha256":"e26e82a2697cb57e25d5618d76e70b12451c6a1eb58fd7bfade305a1b7b2ea18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e26e82a2697cb57e25d5618d76e70b12451c6a1eb58fd7bfade305a1b7b2ea18","first_computed_at":"2026-07-05T00:49:01.657518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:49:01.657518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CpizsMLIk5AL6mO9n3Xtpzih5cjDoB3YplSKXiP/JE9+7NkXN7RsbhsGDuYHIQpc3QDYwdtVmPsmDpjHKEVZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:49:01.657895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.11818","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49b01308a08232b06c60bea40d901dd2e167c2d3db42c0327de57c0fe9dc9a98","sha256:b5e4b6172ce93b34bc758e30ea6cfe94e1c767e44d399a5f6677a39d5b96c8c0"],"state_sha256":"d22cb3c3773bf7f660a68daa8a1f8f641eca4fd36e711f5865e39ff520f9fa80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGzy3jt2yD8D52RsXKIV/SnkhSMQPzxXswXzOHGUVH8RadO+w/Xo3pvymw7MNJWu7h+F2k9/cB6J2WKgTG1aCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:14:39.265017Z","bundle_sha256":"92830eab788c46e96a0cee693580405cad6aa0056bb4e407e45e02d7a13dfec3"}}