{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UCO3RKMLWYXXTF3AQTBTDZLBND","short_pith_number":"pith:UCO3RKML","canonical_record":{"source":{"id":"1201.4782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-23T17:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"be67dc38da9994bae1bca9949d5532590a457c5f134361a3f13cca4233bb28d1","abstract_canon_sha256":"381029cb4038ba1c171b65e3b2c72ecdb960ac7e0a6b37b83dd764c91dc8c279"},"schema_version":"1.0"},"canonical_sha256":"a09db8a98bb62f79976084c331e56168df8e6da436c644fc4fc96c8e1b35534c","source":{"kind":"arxiv","id":"1201.4782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4782","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4782v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4782","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"UCO3RKMLWYXX","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UCO3RKMLWYXXTF3A","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UCO3RKML","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UCO3RKMLWYXXTF3AQTBTDZLBND","target":"record","payload":{"canonical_record":{"source":{"id":"1201.4782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-23T17:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"be67dc38da9994bae1bca9949d5532590a457c5f134361a3f13cca4233bb28d1","abstract_canon_sha256":"381029cb4038ba1c171b65e3b2c72ecdb960ac7e0a6b37b83dd764c91dc8c279"},"schema_version":"1.0"},"canonical_sha256":"a09db8a98bb62f79976084c331e56168df8e6da436c644fc4fc96c8e1b35534c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:05.199729Z","signature_b64":"BeyBGjCz9eAkXAm4TlF41qlWUc4N2Hm/700Wdo4AFJWTP1DYCpi5F04ckrLWB8WgLOFabDDuXiGooOz5BV+aBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a09db8a98bb62f79976084c331e56168df8e6da436c644fc4fc96c8e1b35534c","last_reissued_at":"2026-05-18T04:04:05.199291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:05.199291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.4782","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-18T04:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMEbaKPaYnzyYREOv0aW/QWyFc/k7Wru7HEQAEoZoR/TIvPPF6lRZor8xa+PeLx7yWVqJPPWOBwnMTCc/XcsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:46:56.190276Z"},"content_sha256":"7e66c74b6a9c2bb46027c8f7f49d5e6f1ee583ddf8a4d0daa161d5a72d74d50d","schema_version":"1.0","event_id":"sha256:7e66c74b6a9c2bb46027c8f7f49d5e6f1ee583ddf8a4d0daa161d5a72d74d50d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UCO3RKMLWYXXTF3AQTBTDZLBND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blockers for non-crossing spanning trees in complete geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Eduardo Rivera-Campo, Micha A. Perles, Virginia Urrutia-Galicia","submitted_at":"2012-01-23T17:46:27Z","abstract_excerpt":"In this paper we present a complete characterization of the smallest sets that block all the simple spanning trees (SSTs) in a complete geometric graph. We also show that if a subgraph is a blocker for all SSTs of diameter at most 4, then it must block all simple spanning subgraphs, and in particular, all SSTs. For convex geometric graphs, we obtain an even stronger result: being a blocker for all SSTs of diameter at most 3 is already sufficient for blocking all simple spanning subgraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4782","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-18T04:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbGETDBsDjDkKqKS6niEcfQXp/3R2s6tcqQp9Nr8kBNu50TWsPLuzrneIIzfR4cbypbVosKtEHg20OUxV3uaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:46:56.190620Z"},"content_sha256":"cce8a45e7c34f9421c67410028033b307c267b804ba55d83edb262e76f83fd47","schema_version":"1.0","event_id":"sha256:cce8a45e7c34f9421c67410028033b307c267b804ba55d83edb262e76f83fd47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCO3RKMLWYXXTF3AQTBTDZLBND/bundle.json","state_url":"https://pith.science/pith/UCO3RKMLWYXXTF3AQTBTDZLBND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCO3RKMLWYXXTF3AQTBTDZLBND/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-21T10:46:56Z","links":{"resolver":"https://pith.science/pith/UCO3RKMLWYXXTF3AQTBTDZLBND","bundle":"https://pith.science/pith/UCO3RKMLWYXXTF3AQTBTDZLBND/bundle.json","state":"https://pith.science/pith/UCO3RKMLWYXXTF3AQTBTDZLBND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCO3RKMLWYXXTF3AQTBTDZLBND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UCO3RKMLWYXXTF3AQTBTDZLBND","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":"381029cb4038ba1c171b65e3b2c72ecdb960ac7e0a6b37b83dd764c91dc8c279","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-23T17:46:27Z","title_canon_sha256":"be67dc38da9994bae1bca9949d5532590a457c5f134361a3f13cca4233bb28d1"},"schema_version":"1.0","source":{"id":"1201.4782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4782","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4782v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4782","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"UCO3RKMLWYXX","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UCO3RKMLWYXXTF3A","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UCO3RKML","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:cce8a45e7c34f9421c67410028033b307c267b804ba55d83edb262e76f83fd47","target":"graph","created_at":"2026-05-18T04:04:05Z","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":"In this paper we present a complete characterization of the smallest sets that block all the simple spanning trees (SSTs) in a complete geometric graph. We also show that if a subgraph is a blocker for all SSTs of diameter at most 4, then it must block all simple spanning subgraphs, and in particular, all SSTs. For convex geometric graphs, we obtain an even stronger result: being a blocker for all SSTs of diameter at most 3 is already sufficient for blocking all simple spanning subgraphs.","authors_text":"Chaya Keller, Eduardo Rivera-Campo, Micha A. Perles, Virginia Urrutia-Galicia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-23T17:46:27Z","title":"Blockers for non-crossing spanning trees in complete geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4782","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:7e66c74b6a9c2bb46027c8f7f49d5e6f1ee583ddf8a4d0daa161d5a72d74d50d","target":"record","created_at":"2026-05-18T04:04:05Z","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":"381029cb4038ba1c171b65e3b2c72ecdb960ac7e0a6b37b83dd764c91dc8c279","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-23T17:46:27Z","title_canon_sha256":"be67dc38da9994bae1bca9949d5532590a457c5f134361a3f13cca4233bb28d1"},"schema_version":"1.0","source":{"id":"1201.4782","kind":"arxiv","version":1}},"canonical_sha256":"a09db8a98bb62f79976084c331e56168df8e6da436c644fc4fc96c8e1b35534c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a09db8a98bb62f79976084c331e56168df8e6da436c644fc4fc96c8e1b35534c","first_computed_at":"2026-05-18T04:04:05.199291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:05.199291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BeyBGjCz9eAkXAm4TlF41qlWUc4N2Hm/700Wdo4AFJWTP1DYCpi5F04ckrLWB8WgLOFabDDuXiGooOz5BV+aBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:05.199729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e66c74b6a9c2bb46027c8f7f49d5e6f1ee583ddf8a4d0daa161d5a72d74d50d","sha256:cce8a45e7c34f9421c67410028033b307c267b804ba55d83edb262e76f83fd47"],"state_sha256":"60a7b0af9ad556546f5e25c196fb8d483779c7f4e232d532fb8df45249a196ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HOZCVFSrWM+0mAnwT9F9ZgEWjzVHgE3uV4XbWeR4qDOYKjkKoT/2MA3nYz7Pl6wXadqGs9S78Ljy9bRpAJZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T10:46:56.192480Z","bundle_sha256":"2ab415abc499ed2c2e02cda188d1140a70ff478bc08765d927b0ad50c58e8d75"}}