{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HND4CUT7ZGVNSS2AQ7XKCDMY7B","short_pith_number":"pith:HND4CUT7","canonical_record":{"source":{"id":"1707.01239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-05T07:35:46Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"2e0223ef66ec1d5cfa148afe701ebdc2e2e959bc27be80702cda4f8f5dcee1ee","abstract_canon_sha256":"027c533aa108c99860312607088f2b6330b0743492f7c59996cb31f9e9615dbe"},"schema_version":"1.0"},"canonical_sha256":"3b47c1527fc9aad94b4087eea10d98f849c65deed00b939346a0ad990339ed76","source":{"kind":"arxiv","id":"1707.01239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01239","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01239v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01239","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"HND4CUT7ZGVN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HND4CUT7ZGVNSS2A","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HND4CUT7","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HND4CUT7ZGVNSS2AQ7XKCDMY7B","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-05T07:35:46Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"2e0223ef66ec1d5cfa148afe701ebdc2e2e959bc27be80702cda4f8f5dcee1ee","abstract_canon_sha256":"027c533aa108c99860312607088f2b6330b0743492f7c59996cb31f9e9615dbe"},"schema_version":"1.0"},"canonical_sha256":"3b47c1527fc9aad94b4087eea10d98f849c65deed00b939346a0ad990339ed76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:20.883981Z","signature_b64":"7y1sIhThMCUoZ1WWWh90RUgrQcuKRRzLCfXSX/l3el6pOPjxGPpXopaOHGZ+TLoh3p1WFuSJ1CyVI2mkXh09Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b47c1527fc9aad94b4087eea10d98f849c65deed00b939346a0ad990339ed76","last_reissued_at":"2026-05-18T00:06:20.883603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:20.883603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01239","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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fvqm3seC6xxZwjvfgSkprwF8n2R+AHHfODlg2ymIIrsNyVj2emP+PeIPx1v1bvsT+t9bAbrtoAKfINbo7OxQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:14:07.887305Z"},"content_sha256":"0bbb8d7df16e1e57988a7bc3752eed514474e3e859513fcfc68cb18b17bfe1d9","schema_version":"1.0","event_id":"sha256:0bbb8d7df16e1e57988a7bc3752eed514474e3e859513fcfc68cb18b17bfe1d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HND4CUT7ZGVNSS2AQ7XKCDMY7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Placing your Coins on a Shelf","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"Christian Knauer, Fabian Stehn, Helmut Alt, Kevin Buchin, Otfried Cheong, Philipp Kindermann, Steven Chaplick","submitted_at":"2017-07-05T07:35:46Z","abstract_excerpt":"We consider the problem of packing a family of disks \"on a shelf\", that is, such that each disk touches the $x$-axis from above and such that no two disks overlap. We prove that the problem of minimizing the distance between the leftmost point and the rightmost point of any disk is NP-hard. On the positive side, we show how to approximate this problem within a factor of 4/3 in $O(n \\log n)$ time, and provide an $O(n \\log n)$-time exact algorithm for a special case, in particular when the ratio between the largest and smallest radius is at most four."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01239","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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeibK1NDfvbEfZpuQbpwEHsGMb9DvGypvtzjIad3XXmg9CKg5+JpP21AHQ7hpIFDKNCMRKL/rr8aollozSFTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:14:07.887673Z"},"content_sha256":"d1dfb3ceea300c8ebf793f19a13fc4da6810d351773c221c356577220770297b","schema_version":"1.0","event_id":"sha256:d1dfb3ceea300c8ebf793f19a13fc4da6810d351773c221c356577220770297b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HND4CUT7ZGVNSS2AQ7XKCDMY7B/bundle.json","state_url":"https://pith.science/pith/HND4CUT7ZGVNSS2AQ7XKCDMY7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HND4CUT7ZGVNSS2AQ7XKCDMY7B/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-05-21T11:14:07Z","links":{"resolver":"https://pith.science/pith/HND4CUT7ZGVNSS2AQ7XKCDMY7B","bundle":"https://pith.science/pith/HND4CUT7ZGVNSS2AQ7XKCDMY7B/bundle.json","state":"https://pith.science/pith/HND4CUT7ZGVNSS2AQ7XKCDMY7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HND4CUT7ZGVNSS2AQ7XKCDMY7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HND4CUT7ZGVNSS2AQ7XKCDMY7B","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":"027c533aa108c99860312607088f2b6330b0743492f7c59996cb31f9e9615dbe","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-05T07:35:46Z","title_canon_sha256":"2e0223ef66ec1d5cfa148afe701ebdc2e2e959bc27be80702cda4f8f5dcee1ee"},"schema_version":"1.0","source":{"id":"1707.01239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01239","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01239v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01239","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"HND4CUT7ZGVN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HND4CUT7ZGVNSS2A","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HND4CUT7","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:d1dfb3ceea300c8ebf793f19a13fc4da6810d351773c221c356577220770297b","target":"graph","created_at":"2026-05-18T00:06:20Z","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":"We consider the problem of packing a family of disks \"on a shelf\", that is, such that each disk touches the $x$-axis from above and such that no two disks overlap. We prove that the problem of minimizing the distance between the leftmost point and the rightmost point of any disk is NP-hard. On the positive side, we show how to approximate this problem within a factor of 4/3 in $O(n \\log n)$ time, and provide an $O(n \\log n)$-time exact algorithm for a special case, in particular when the ratio between the largest and smallest radius is at most four.","authors_text":"Christian Knauer, Fabian Stehn, Helmut Alt, Kevin Buchin, Otfried Cheong, Philipp Kindermann, Steven Chaplick","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-05T07:35:46Z","title":"Placing your Coins on a Shelf"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01239","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:0bbb8d7df16e1e57988a7bc3752eed514474e3e859513fcfc68cb18b17bfe1d9","target":"record","created_at":"2026-05-18T00:06:20Z","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":"027c533aa108c99860312607088f2b6330b0743492f7c59996cb31f9e9615dbe","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-05T07:35:46Z","title_canon_sha256":"2e0223ef66ec1d5cfa148afe701ebdc2e2e959bc27be80702cda4f8f5dcee1ee"},"schema_version":"1.0","source":{"id":"1707.01239","kind":"arxiv","version":2}},"canonical_sha256":"3b47c1527fc9aad94b4087eea10d98f849c65deed00b939346a0ad990339ed76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b47c1527fc9aad94b4087eea10d98f849c65deed00b939346a0ad990339ed76","first_computed_at":"2026-05-18T00:06:20.883603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:20.883603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7y1sIhThMCUoZ1WWWh90RUgrQcuKRRzLCfXSX/l3el6pOPjxGPpXopaOHGZ+TLoh3p1WFuSJ1CyVI2mkXh09Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:20.883981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bbb8d7df16e1e57988a7bc3752eed514474e3e859513fcfc68cb18b17bfe1d9","sha256:d1dfb3ceea300c8ebf793f19a13fc4da6810d351773c221c356577220770297b"],"state_sha256":"4fa85341ae831f68c03b08d5855b20172b29fc7d92e1d6224aa0a4acbf119442"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGmEYuIUOp6OLBvqp8WnyLnFmYP9fss5Nv9kLt1Kt6kEBGoqnUMsI4Pt0jFMsm3wdD4JXOAaQxwQZCxYwawzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T11:14:07.890025Z","bundle_sha256":"94a8bd9f50837b7a33977de2b3990baf1f3e4c1605336841c2029a3f13692018"}}