{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B5KTDY3PURXOZWLAT6FAZHJ3UC","short_pith_number":"pith:B5KTDY3P","canonical_record":{"source":{"id":"1612.02412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-12-07T20:44:21Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"233cb0eba3078dbc33cbed676a06204117221c92c2e4fe87e6284de4743083ef","abstract_canon_sha256":"4874afaa6e8342f716fac5ccdc930d896bb00c08b3aecb1c6002bf3afaa632d7"},"schema_version":"1.0"},"canonical_sha256":"0f5531e36fa46eecd9609f8a0c9d3ba083f62278f1b633224f33ab18ddbf6565","source":{"kind":"arxiv","id":"1612.02412","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02412","created_at":"2026-05-18T00:32:02Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02412v2","created_at":"2026-05-18T00:32:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02412","created_at":"2026-05-18T00:32:02Z"},{"alias_kind":"pith_short_12","alias_value":"B5KTDY3PURXO","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B5KTDY3PURXOZWLA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B5KTDY3P","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B5KTDY3PURXOZWLAT6FAZHJ3UC","target":"record","payload":{"canonical_record":{"source":{"id":"1612.02412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-12-07T20:44:21Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"233cb0eba3078dbc33cbed676a06204117221c92c2e4fe87e6284de4743083ef","abstract_canon_sha256":"4874afaa6e8342f716fac5ccdc930d896bb00c08b3aecb1c6002bf3afaa632d7"},"schema_version":"1.0"},"canonical_sha256":"0f5531e36fa46eecd9609f8a0c9d3ba083f62278f1b633224f33ab18ddbf6565","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:02.944857Z","signature_b64":"+1cAp954J0X6rceGDsL4lp3ADMfI5g6qmdI+gQCp85UyzxaP+t4AhGADbRYuhjAkQ7RkoebBY/OI8kOhI9SZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f5531e36fa46eecd9609f8a0c9d3ba083f62278f1b633224f33ab18ddbf6565","last_reissued_at":"2026-05-18T00:32:02.944378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:02.944378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.02412","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-05-18T00:32:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnS3t9OAhUBV4w7YcbAOs6MpHKDOcyZAfDNFvA3Q81uzMcIBTgBSKdmN+PGLNqiutmmfBp/NJWtVBiIdMm23Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:18:18.229009Z"},"content_sha256":"e7de6c6bbd3eb8beb4e8fc73d3979f3ee009bd78dd72275b29551d7d671e740f","schema_version":"1.0","event_id":"sha256:e7de6c6bbd3eb8beb4e8fc73d3979f3ee009bd78dd72275b29551d7d671e740f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B5KTDY3PURXOZWLAT6FAZHJ3UC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortcuts for the Circle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.MG","authors_text":"Christos Levcopoulos, Joachim Gudmundsson, Mark de Berg, Otfried Cheong, Sang Won Bae","submitted_at":"2016-12-07T20:44:21Z","abstract_excerpt":"Let $C$ be the unit circle in $\\mathbb{R}^2$. We can view $C$ as a plane graph whose vertices are all the points on $C$, and the distance between any two points on $C$ is the length of the smaller arc between them. We consider a graph augmentation problem on $C$, where we want to place $k\\geq 1$ \\emph{shortcuts} on $C$ such that the diameter of the resulting graph is minimized.\n  We analyze for each $k$ with $1\\leq k\\leq 7$ what the optimal set of shortcuts is. Interestingly, the minimum diameter one can obtain is not a strictly decreasing function of~$k$. For example, with seven shortcuts one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02412","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":""},"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:32:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17GjGj1Vwdi/lGEGrQ/JiDBWuAvnsj3P8o2dYc8yTlSectuzmNXcGo1xht0Do0syvgd4R6+J52N1oiLsp1xECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:18:18.229626Z"},"content_sha256":"3a94d28ff3181655c499d4d716b0546e66542dc86b150a0633fd166eb95d6a63","schema_version":"1.0","event_id":"sha256:3a94d28ff3181655c499d4d716b0546e66542dc86b150a0633fd166eb95d6a63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5KTDY3PURXOZWLAT6FAZHJ3UC/bundle.json","state_url":"https://pith.science/pith/B5KTDY3PURXOZWLAT6FAZHJ3UC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5KTDY3PURXOZWLAT6FAZHJ3UC/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-06T13:18:18Z","links":{"resolver":"https://pith.science/pith/B5KTDY3PURXOZWLAT6FAZHJ3UC","bundle":"https://pith.science/pith/B5KTDY3PURXOZWLAT6FAZHJ3UC/bundle.json","state":"https://pith.science/pith/B5KTDY3PURXOZWLAT6FAZHJ3UC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5KTDY3PURXOZWLAT6FAZHJ3UC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B5KTDY3PURXOZWLAT6FAZHJ3UC","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":"4874afaa6e8342f716fac5ccdc930d896bb00c08b3aecb1c6002bf3afaa632d7","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-12-07T20:44:21Z","title_canon_sha256":"233cb0eba3078dbc33cbed676a06204117221c92c2e4fe87e6284de4743083ef"},"schema_version":"1.0","source":{"id":"1612.02412","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02412","created_at":"2026-05-18T00:32:02Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02412v2","created_at":"2026-05-18T00:32:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02412","created_at":"2026-05-18T00:32:02Z"},{"alias_kind":"pith_short_12","alias_value":"B5KTDY3PURXO","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B5KTDY3PURXOZWLA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B5KTDY3P","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:3a94d28ff3181655c499d4d716b0546e66542dc86b150a0633fd166eb95d6a63","target":"graph","created_at":"2026-05-18T00:32:02Z","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 $C$ be the unit circle in $\\mathbb{R}^2$. We can view $C$ as a plane graph whose vertices are all the points on $C$, and the distance between any two points on $C$ is the length of the smaller arc between them. We consider a graph augmentation problem on $C$, where we want to place $k\\geq 1$ \\emph{shortcuts} on $C$ such that the diameter of the resulting graph is minimized.\n  We analyze for each $k$ with $1\\leq k\\leq 7$ what the optimal set of shortcuts is. Interestingly, the minimum diameter one can obtain is not a strictly decreasing function of~$k$. For example, with seven shortcuts one","authors_text":"Christos Levcopoulos, Joachim Gudmundsson, Mark de Berg, Otfried Cheong, Sang Won Bae","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-12-07T20:44:21Z","title":"Shortcuts for the Circle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02412","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:e7de6c6bbd3eb8beb4e8fc73d3979f3ee009bd78dd72275b29551d7d671e740f","target":"record","created_at":"2026-05-18T00:32:02Z","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":"4874afaa6e8342f716fac5ccdc930d896bb00c08b3aecb1c6002bf3afaa632d7","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-12-07T20:44:21Z","title_canon_sha256":"233cb0eba3078dbc33cbed676a06204117221c92c2e4fe87e6284de4743083ef"},"schema_version":"1.0","source":{"id":"1612.02412","kind":"arxiv","version":2}},"canonical_sha256":"0f5531e36fa46eecd9609f8a0c9d3ba083f62278f1b633224f33ab18ddbf6565","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f5531e36fa46eecd9609f8a0c9d3ba083f62278f1b633224f33ab18ddbf6565","first_computed_at":"2026-05-18T00:32:02.944378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:02.944378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1cAp954J0X6rceGDsL4lp3ADMfI5g6qmdI+gQCp85UyzxaP+t4AhGADbRYuhjAkQ7RkoebBY/OI8kOhI9SZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:02.944857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02412","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7de6c6bbd3eb8beb4e8fc73d3979f3ee009bd78dd72275b29551d7d671e740f","sha256:3a94d28ff3181655c499d4d716b0546e66542dc86b150a0633fd166eb95d6a63"],"state_sha256":"cdb1c902a2177efb3bc8707395821074e204ba651b06490fd31fd7084a8ed5b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+SFrzGTx/LZEfMcvsqOSd3LapbKZF5Sqo9frpqb1aulV047+Gqr+qrU8TU8ET1jO5LARs70s1HucGyRuIDaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:18:18.233559Z","bundle_sha256":"af14f479591df32576d68fe81a8ce03ac3ff696c60d27ae1acac295ff36ff5f4"}}