{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z5LVYXDK24YGZCMCDZNWAGMMUB","short_pith_number":"pith:Z5LVYXDK","canonical_record":{"source":{"id":"1605.09244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-30T14:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"43e50939ea3c2a9c236393a4267ba9912b1f01dd12d91634809800c1731551f8","abstract_canon_sha256":"4c346856d87b5c95163d92a783070cf9bd6dd549f509679a730b73b3a55e08bc"},"schema_version":"1.0"},"canonical_sha256":"cf575c5c6ad7306c89821e5b60198ca04866388a65bbe099667d297b3f203219","source":{"kind":"arxiv","id":"1605.09244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09244","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09244v1","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09244","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"Z5LVYXDK24YG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z5LVYXDK24YGZCMC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z5LVYXDK","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z5LVYXDK24YGZCMCDZNWAGMMUB","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-30T14:15:31Z","cross_cats_sorted":[],"title_canon_sha256":"43e50939ea3c2a9c236393a4267ba9912b1f01dd12d91634809800c1731551f8","abstract_canon_sha256":"4c346856d87b5c95163d92a783070cf9bd6dd549f509679a730b73b3a55e08bc"},"schema_version":"1.0"},"canonical_sha256":"cf575c5c6ad7306c89821e5b60198ca04866388a65bbe099667d297b3f203219","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:21.593725Z","signature_b64":"pq9rfUZwIgBMCTsRfOB0ootTQp15k0fKZEp/q6uPXR7cUo91boqubDXBtRWzeru5SQlM846XtW6K2hFTZ6ghDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf575c5c6ad7306c89821e5b60198ca04866388a65bbe099667d297b3f203219","last_reissued_at":"2026-05-18T01:13:21.593006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:21.593006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09244","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-18T01:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HaI5Da4YUHafMN9zJhTX/OVG5fIekYYhE/BIzdf2RZ5EuLz28+ar3Zti7s5jjHOcvmpdaDYDV+RPadBbT01LBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:48:22.648257Z"},"content_sha256":"7b8a4de37183b993c535c7c9b602890f4f08b738cb09af448756d0e294b187c4","schema_version":"1.0","event_id":"sha256:7b8a4de37183b993c535c7c9b602890f4f08b738cb09af448756d0e294b187c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z5LVYXDK24YGZCMCDZNWAGMMUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Area Requirement of Euclidean Greedy Embeddings of Christmas Cactus Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Roman Prutkin","submitted_at":"2016-05-30T14:15:31Z","abstract_excerpt":"An Euclidean greedy embedding of a graph is a straight-line embedding in the plane, such that for every pair of vertices $s$ and $t$, the vertex $s$ has a neighbor $v$ with smaller distance to $t$ than $s$. This drawing style is motivated by greedy geometric routing in wireless sensor networks.\n  A Christmas cactus is a connected graph in which every two simple cycles have at most one vertex in common and in which every cutvertex is part of at most two biconnected blocks. It has been proved that Christmas cactus graphs have an Euclidean greedy embedding. This fact has played a crucial role in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09244","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-18T01:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JdVjTDvYYH/r2ID/4thkP+sWMEupJfi+73dfgt0MscVyjI763rgZwD/Huu0IHkIVwKtKI0Qih2DgepgVdjdWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:48:22.648616Z"},"content_sha256":"6ddb4fd721d15e83b39e2ac44bf262cc7c2ac5b95cbac4db0330b7e32d53a9de","schema_version":"1.0","event_id":"sha256:6ddb4fd721d15e83b39e2ac44bf262cc7c2ac5b95cbac4db0330b7e32d53a9de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5LVYXDK24YGZCMCDZNWAGMMUB/bundle.json","state_url":"https://pith.science/pith/Z5LVYXDK24YGZCMCDZNWAGMMUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5LVYXDK24YGZCMCDZNWAGMMUB/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-27T18:48:22Z","links":{"resolver":"https://pith.science/pith/Z5LVYXDK24YGZCMCDZNWAGMMUB","bundle":"https://pith.science/pith/Z5LVYXDK24YGZCMCDZNWAGMMUB/bundle.json","state":"https://pith.science/pith/Z5LVYXDK24YGZCMCDZNWAGMMUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5LVYXDK24YGZCMCDZNWAGMMUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z5LVYXDK24YGZCMCDZNWAGMMUB","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":"4c346856d87b5c95163d92a783070cf9bd6dd549f509679a730b73b3a55e08bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-30T14:15:31Z","title_canon_sha256":"43e50939ea3c2a9c236393a4267ba9912b1f01dd12d91634809800c1731551f8"},"schema_version":"1.0","source":{"id":"1605.09244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09244","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09244v1","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09244","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"Z5LVYXDK24YG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z5LVYXDK24YGZCMC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z5LVYXDK","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:6ddb4fd721d15e83b39e2ac44bf262cc7c2ac5b95cbac4db0330b7e32d53a9de","target":"graph","created_at":"2026-05-18T01:13:21Z","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":"An Euclidean greedy embedding of a graph is a straight-line embedding in the plane, such that for every pair of vertices $s$ and $t$, the vertex $s$ has a neighbor $v$ with smaller distance to $t$ than $s$. This drawing style is motivated by greedy geometric routing in wireless sensor networks.\n  A Christmas cactus is a connected graph in which every two simple cycles have at most one vertex in common and in which every cutvertex is part of at most two biconnected blocks. It has been proved that Christmas cactus graphs have an Euclidean greedy embedding. This fact has played a crucial role in ","authors_text":"Roman Prutkin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-30T14:15:31Z","title":"A Note on the Area Requirement of Euclidean Greedy Embeddings of Christmas Cactus Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09244","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:7b8a4de37183b993c535c7c9b602890f4f08b738cb09af448756d0e294b187c4","target":"record","created_at":"2026-05-18T01:13:21Z","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":"4c346856d87b5c95163d92a783070cf9bd6dd549f509679a730b73b3a55e08bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-30T14:15:31Z","title_canon_sha256":"43e50939ea3c2a9c236393a4267ba9912b1f01dd12d91634809800c1731551f8"},"schema_version":"1.0","source":{"id":"1605.09244","kind":"arxiv","version":1}},"canonical_sha256":"cf575c5c6ad7306c89821e5b60198ca04866388a65bbe099667d297b3f203219","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf575c5c6ad7306c89821e5b60198ca04866388a65bbe099667d297b3f203219","first_computed_at":"2026-05-18T01:13:21.593006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:21.593006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pq9rfUZwIgBMCTsRfOB0ootTQp15k0fKZEp/q6uPXR7cUo91boqubDXBtRWzeru5SQlM846XtW6K2hFTZ6ghDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:21.593725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b8a4de37183b993c535c7c9b602890f4f08b738cb09af448756d0e294b187c4","sha256:6ddb4fd721d15e83b39e2ac44bf262cc7c2ac5b95cbac4db0330b7e32d53a9de"],"state_sha256":"b48da2fbd4a76866bfa21ad0ccd41dc3e5874db976311491070d81cf10c522a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OHYjv7naFqy8Eq4XP4W2r52iYb1sbFsE2j6x1llL7qvYhpUVtnQKmiRp0Q2OeN1Y/IwkOzvwy6C5A87MEMkDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:48:22.650456Z","bundle_sha256":"2d7d85ea6f75a98154fd339ef2cebc2879a27cc7d00451cbbfd9f75a55a10f3b"}}