{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MOMN7ZPUXK6N3PT54SVW2II32E","short_pith_number":"pith:MOMN7ZPU","schema_version":"1.0","canonical_sha256":"6398dfe5f4babcddbe7de4ab6d211bd116265493f61476aeba1d02a3b693c38c","source":{"kind":"arxiv","id":"1304.5971","version":1},"attestation_state":"computed","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. "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.5971","created_at":"2026-05-18T03:27:23.630828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5971v1","created_at":"2026-05-18T03:27:23.630828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5971","created_at":"2026-05-18T03:27:23.630828+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOMN7ZPUXK6N","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOMN7ZPUXK6N3PT5","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOMN7ZPU","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E","json":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E.json","graph_json":"https://pith.science/api/pith-number/MOMN7ZPUXK6N3PT54SVW2II32E/graph.json","events_json":"https://pith.science/api/pith-number/MOMN7ZPUXK6N3PT54SVW2II32E/events.json","paper":"https://pith.science/paper/MOMN7ZPU"},"agent_actions":{"view_html":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E","download_json":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E.json","view_paper":"https://pith.science/paper/MOMN7ZPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5971&json=true","fetch_graph":"https://pith.science/api/pith-number/MOMN7ZPUXK6N3PT54SVW2II32E/graph.json","fetch_events":"https://pith.science/api/pith-number/MOMN7ZPUXK6N3PT54SVW2II32E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/action/storage_attestation","attest_author":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/action/author_attestation","sign_citation":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/action/citation_signature","submit_replication":"https://pith.science/pith/MOMN7ZPUXK6N3PT54SVW2II32E/action/replication_record"}},"created_at":"2026-05-18T03:27:23.630828+00:00","updated_at":"2026-05-18T03:27:23.630828+00:00"}