{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MOMN7ZPUXK6N3PT54SVW2II32E","short_pith_number":"pith:MOMN7ZPU","canonical_record":{"source":{"id":"1304.5971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T14:49:39Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"bf3013c18028202d2bd109f372045675aea93c36a42e004b248bdafbd536c679","abstract_canon_sha256":"ef660a1da696f84b326249e4b442bca6e58107b92bce3db62ee7e1d1ea3281c3"},"schema_version":"1.0"},"canonical_sha256":"6398dfe5f4babcddbe7de4ab6d211bd116265493f61476aeba1d02a3b693c38c","source":{"kind":"arxiv","id":"1304.5971","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5971","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5971v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5971","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"MOMN7ZPUXK6N","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MOMN7ZPUXK6N3PT5","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MOMN7ZPU","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MOMN7ZPUXK6N3PT54SVW2II32E","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T14:49:39Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"bf3013c18028202d2bd109f372045675aea93c36a42e004b248bdafbd536c679","abstract_canon_sha256":"ef660a1da696f84b326249e4b442bca6e58107b92bce3db62ee7e1d1ea3281c3"},"schema_version":"1.0"},"canonical_sha256":"6398dfe5f4babcddbe7de4ab6d211bd116265493f61476aeba1d02a3b693c38c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:23.631291Z","signature_b64":"iCqBH5NMvIq2uPxZv2L/AWoTA8aCgdQ/o3HdiZUpAahdX8P/S07XAHNis4s6FWCEhcr2OEIX4PJ31HYHWHJLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6398dfe5f4babcddbe7de4ab6d211bd116265493f61476aeba1d02a3b693c38c","last_reissued_at":"2026-05-18T03:27:23.630744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:23.630744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5971","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-18T03:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfPpUulm+GUTORsdZLpWyaVw7U2R07e7oMS0ukqnm92upV3Jc0XlsFWipn7KY0MftTnA/cLY+GcSIwXKCSKyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:21:53.869502Z"},"content_sha256":"5cae19c619f14fe110931a564fdb8929ebe123b5a9246ac1b0c4a2d3b4631bc8","schema_version":"1.0","event_id":"sha256:5cae19c619f14fe110931a564fdb8929ebe123b5a9246ac1b0c4a2d3b4631bc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MOMN7ZPUXK6N3PT54SVW2II32E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Competitive Strategy for Distance-Aware Online Shape Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Jan-Marc Reinhardt, Nils Schweer, S\\'andor P. Fekete","submitted_at":"2013-04-22T14:49:39Z","abstract_excerpt":"We consider the following online allocation problem: Given a unit square S, and a sequence of numbers n_i between 0 and 1, with partial sum bounded by 1; at each step i, select a region C_i of previously unassigned area n_i in S. The objective is to make these regions compact in a distance-aware sense: minimize the maximum (normalized) average Manhattan distance between points from the same set C_i. Related location problems have received a considerable amount of attention; in particular, the problem of determining the \"optimal shape of a city\", i.e., allocating a single n_i has been studied. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5971","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-18T03:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEVNr8WZft/722rTUFFg7nmnzzTMWF7ZltIXC41Nldg/eTrss604B8srjEYQTA1UrS1LPEa0qQmjFztlzkj4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:21:53.869856Z"},"content_sha256":"a46f5d936fbd3cbb9e0dd65f9f167b6e2033f99c082bffa965bfc8f68e12e97c","schema_version":"1.0","event_id":"sha256:a46f5d936fbd3cbb9e0dd65f9f167b6e2033f99c082bffa965bfc8f68e12e97c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/bundle.json","state_url":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOMN7ZPUXK6N3PT54SVW2II32E/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-28T02:21:53Z","links":{"resolver":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E","bundle":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/bundle.json","state":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOMN7ZPUXK6N3PT54SVW2II32E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MOMN7ZPUXK6N3PT54SVW2II32E","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":"ef660a1da696f84b326249e4b442bca6e58107b92bce3db62ee7e1d1ea3281c3","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T14:49:39Z","title_canon_sha256":"bf3013c18028202d2bd109f372045675aea93c36a42e004b248bdafbd536c679"},"schema_version":"1.0","source":{"id":"1304.5971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5971","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5971v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5971","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"MOMN7ZPUXK6N","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MOMN7ZPUXK6N3PT5","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MOMN7ZPU","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:a46f5d936fbd3cbb9e0dd65f9f167b6e2033f99c082bffa965bfc8f68e12e97c","target":"graph","created_at":"2026-05-18T03:27:23Z","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 following online allocation problem: Given a unit square S, and a sequence of numbers n_i between 0 and 1, with partial sum bounded by 1; at each step i, select a region C_i of previously unassigned area n_i in S. The objective is to make these regions compact in a distance-aware sense: minimize the maximum (normalized) average Manhattan distance between points from the same set C_i. Related location problems have received a considerable amount of attention; in particular, the problem of determining the \"optimal shape of a city\", i.e., allocating a single n_i has been studied. ","authors_text":"Jan-Marc Reinhardt, Nils Schweer, S\\'andor P. Fekete","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T14:49:39Z","title":"A Competitive Strategy for Distance-Aware Online Shape Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5971","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:5cae19c619f14fe110931a564fdb8929ebe123b5a9246ac1b0c4a2d3b4631bc8","target":"record","created_at":"2026-05-18T03:27:23Z","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":"ef660a1da696f84b326249e4b442bca6e58107b92bce3db62ee7e1d1ea3281c3","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T14:49:39Z","title_canon_sha256":"bf3013c18028202d2bd109f372045675aea93c36a42e004b248bdafbd536c679"},"schema_version":"1.0","source":{"id":"1304.5971","kind":"arxiv","version":1}},"canonical_sha256":"6398dfe5f4babcddbe7de4ab6d211bd116265493f61476aeba1d02a3b693c38c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6398dfe5f4babcddbe7de4ab6d211bd116265493f61476aeba1d02a3b693c38c","first_computed_at":"2026-05-18T03:27:23.630744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:23.630744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iCqBH5NMvIq2uPxZv2L/AWoTA8aCgdQ/o3HdiZUpAahdX8P/S07XAHNis4s6FWCEhcr2OEIX4PJ31HYHWHJLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:23.631291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cae19c619f14fe110931a564fdb8929ebe123b5a9246ac1b0c4a2d3b4631bc8","sha256:a46f5d936fbd3cbb9e0dd65f9f167b6e2033f99c082bffa965bfc8f68e12e97c"],"state_sha256":"4725d8deec145662769b05f2a55bbffebe3defb49b4e5475ca08359a46b6121c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCeI01qejz28lojzyGAyTJad1KpKclNdTW9cV6N/kP48ZdktPmnvfJxHW5IbPcDh17BffuM4XccCBKWF6TmYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:21:53.871842Z","bundle_sha256":"60e4da2550a33c4bf67c9a25ad661e3ca9988d0ee70ef3504ff19561a081bfaf"}}