{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TY5VAUZKLQNCUFXLT3BDDFNEG5","short_pith_number":"pith:TY5VAUZK","canonical_record":{"source":{"id":"1801.00324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-31T17:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"89e0a4967ef67e4c4d60b1b0c0749a61947a068da51164e0844458f015ad52f4","abstract_canon_sha256":"2d30e94f64d3443f564bfa69849d25055b0aa99312924fd8200541eec2d1b679"},"schema_version":"1.0"},"canonical_sha256":"9e3b50532a5c1a2a16eb9ec23195a4377cc87f3c6347038168ec2835c7cde74d","source":{"kind":"arxiv","id":"1801.00324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00324","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00324v1","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00324","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"TY5VAUZKLQNC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TY5VAUZKLQNCUFXL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TY5VAUZK","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TY5VAUZKLQNCUFXLT3BDDFNEG5","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-31T17:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"89e0a4967ef67e4c4d60b1b0c0749a61947a068da51164e0844458f015ad52f4","abstract_canon_sha256":"2d30e94f64d3443f564bfa69849d25055b0aa99312924fd8200541eec2d1b679"},"schema_version":"1.0"},"canonical_sha256":"9e3b50532a5c1a2a16eb9ec23195a4377cc87f3c6347038168ec2835c7cde74d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:58.697453Z","signature_b64":"KZo4ROSHeSroqB4LdzONG3jW6GodIL2JzEQ9xPoqN9GcCsPD7irF2w1jyfPHqGBDD+RRgUEYxdGciBwAMCeYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e3b50532a5c1a2a16eb9ec23195a4377cc87f3c6347038168ec2835c7cde74d","last_reissued_at":"2026-05-18T00:26:58.696804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:58.696804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00324","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-18T00:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRsQRVLpSl5Jx637S1SQGGiLUahWrrpte2ZnfJlvupUqgGGhBCjhsBcv5licYGPxjVPhfUU8+v03DlGmIqKJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:56:21.346423Z"},"content_sha256":"7d313d755dcdbdc871017e19661bad65f10d80606dda4cfe60e7d4d591c82ac5","schema_version":"1.0","event_id":"sha256:7d313d755dcdbdc871017e19661bad65f10d80606dda4cfe60e7d4d591c82ac5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TY5VAUZKLQNCUFXLT3BDDFNEG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Yael Stein","submitted_at":"2017-12-31T17:34:24Z","abstract_excerpt":"Let $G$ be a complete convex geometric graph whose vertex set $P$ forms a convex polygon $C$, and let $F$ be a family of subgraphs of $G$. A blocker for $F$ is a set of edges, of smallest possible size, that contains a common edge with every element of $F$. Previous works determined the blockers for various families $F$ of non-crossing subgraphs, including the families of all perfect matchings, all spanning trees, all Hamiltonian paths, etc.\n  In this paper we present a complete characterization of the family $B$ of blockers for the family $T$ of triangulations of $C$. In particular, we show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00324","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-18T00:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kWWO/whKNobSaymG92A8JxhjvggxGgGj4LxqIkWmdLge1gfvc7APyQKSj4mWjBZpvnH6aRI7Wu64PNIZd8F8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:56:21.346764Z"},"content_sha256":"ba6a43a60ca8c371d23eaf54f38d471b1ce99008a180b6d7fb16566fd403e541","schema_version":"1.0","event_id":"sha256:ba6a43a60ca8c371d23eaf54f38d471b1ce99008a180b6d7fb16566fd403e541"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TY5VAUZKLQNCUFXLT3BDDFNEG5/bundle.json","state_url":"https://pith.science/pith/TY5VAUZKLQNCUFXLT3BDDFNEG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TY5VAUZKLQNCUFXLT3BDDFNEG5/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-21T09:56:21Z","links":{"resolver":"https://pith.science/pith/TY5VAUZKLQNCUFXLT3BDDFNEG5","bundle":"https://pith.science/pith/TY5VAUZKLQNCUFXLT3BDDFNEG5/bundle.json","state":"https://pith.science/pith/TY5VAUZKLQNCUFXLT3BDDFNEG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TY5VAUZKLQNCUFXLT3BDDFNEG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TY5VAUZKLQNCUFXLT3BDDFNEG5","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":"2d30e94f64d3443f564bfa69849d25055b0aa99312924fd8200541eec2d1b679","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-31T17:34:24Z","title_canon_sha256":"89e0a4967ef67e4c4d60b1b0c0749a61947a068da51164e0844458f015ad52f4"},"schema_version":"1.0","source":{"id":"1801.00324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00324","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00324v1","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00324","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"TY5VAUZKLQNC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TY5VAUZKLQNCUFXL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TY5VAUZK","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:ba6a43a60ca8c371d23eaf54f38d471b1ce99008a180b6d7fb16566fd403e541","target":"graph","created_at":"2026-05-18T00:26:58Z","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":"Let $G$ be a complete convex geometric graph whose vertex set $P$ forms a convex polygon $C$, and let $F$ be a family of subgraphs of $G$. A blocker for $F$ is a set of edges, of smallest possible size, that contains a common edge with every element of $F$. Previous works determined the blockers for various families $F$ of non-crossing subgraphs, including the families of all perfect matchings, all spanning trees, all Hamiltonian paths, etc.\n  In this paper we present a complete characterization of the family $B$ of blockers for the family $T$ of triangulations of $C$. In particular, we show t","authors_text":"Chaya Keller, Yael Stein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-31T17:34:24Z","title":"Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00324","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:7d313d755dcdbdc871017e19661bad65f10d80606dda4cfe60e7d4d591c82ac5","target":"record","created_at":"2026-05-18T00:26:58Z","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":"2d30e94f64d3443f564bfa69849d25055b0aa99312924fd8200541eec2d1b679","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-31T17:34:24Z","title_canon_sha256":"89e0a4967ef67e4c4d60b1b0c0749a61947a068da51164e0844458f015ad52f4"},"schema_version":"1.0","source":{"id":"1801.00324","kind":"arxiv","version":1}},"canonical_sha256":"9e3b50532a5c1a2a16eb9ec23195a4377cc87f3c6347038168ec2835c7cde74d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e3b50532a5c1a2a16eb9ec23195a4377cc87f3c6347038168ec2835c7cde74d","first_computed_at":"2026-05-18T00:26:58.696804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:58.696804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZo4ROSHeSroqB4LdzONG3jW6GodIL2JzEQ9xPoqN9GcCsPD7irF2w1jyfPHqGBDD+RRgUEYxdGciBwAMCeYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:58.697453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d313d755dcdbdc871017e19661bad65f10d80606dda4cfe60e7d4d591c82ac5","sha256:ba6a43a60ca8c371d23eaf54f38d471b1ce99008a180b6d7fb16566fd403e541"],"state_sha256":"8e024386335d04296b86e0d78fe2031768fd38030b00581ceae1764891af28a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yjp3KHcUTHChjgnZBR3JvtORnvnusau7eg+s1RCSa8UZxdS0x0kon6AKdSgARHyuF/LF+obgM4zIGa5HAjhMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T09:56:21.348639Z","bundle_sha256":"2b176acec39dfdcf2b3f5747c3c9122064425fe381e0212eb54675c89dee27ec"}}