{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QO4CHCJF3L6CMWAXMYOC3Q63AM","short_pith_number":"pith:QO4CHCJF","canonical_record":{"source":{"id":"1009.5628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-09-28T16:31:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3744ee4a5096ffd61df42887b9e7ccab6b734e8717d339b5a187784949be46fe","abstract_canon_sha256":"31a0d9de874afde13cf00202fc66aa02e83ea403b99ccd91db0f23d17d0faf1c"},"schema_version":"1.0"},"canonical_sha256":"83b8238925dafc265817661c2dc3db032a18b745cce1e2d078a134a9f6971a3f","source":{"kind":"arxiv","id":"1009.5628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5628","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5628v1","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5628","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"QO4CHCJF3L6C","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QO4CHCJF3L6CMWAX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QO4CHCJF","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QO4CHCJF3L6CMWAXMYOC3Q63AM","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-09-28T16:31:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3744ee4a5096ffd61df42887b9e7ccab6b734e8717d339b5a187784949be46fe","abstract_canon_sha256":"31a0d9de874afde13cf00202fc66aa02e83ea403b99ccd91db0f23d17d0faf1c"},"schema_version":"1.0"},"canonical_sha256":"83b8238925dafc265817661c2dc3db032a18b745cce1e2d078a134a9f6971a3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:22.930797Z","signature_b64":"OPHaPCsLPJPEbH87CYw/NvCDrXCGrgDou7Nhx0AfXA4ZC/yvssvIS34xVMwgztaMv/rpBuRpFS+jykofOQbdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b8238925dafc265817661c2dc3db032a18b745cce1e2d078a134a9f6971a3f","last_reissued_at":"2026-05-18T00:30:22.930035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:22.930035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5628","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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SpN3e8BzwRF2FSD9mPtjGdpi858GRYK9Zu1LnF6i5RtdVt0iBq0LgyD/6UuK/FZm7DLDweJK/79o10/iUw6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:14:01.097556Z"},"content_sha256":"c6b906384fddd34bfd89b9f238c111581ed26b92bcf0e0516a83ccd548813117","schema_version":"1.0","event_id":"sha256:c6b906384fddd34bfd89b9f238c111581ed26b92bcf0e0516a83ccd548813117"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QO4CHCJF3L6CMWAXMYOC3Q63AM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Daria Schymura, Erik D. Demaine, Guenter Rote, Mariano Zelke, Nils Schweer, Sandor P. Fekete","submitted_at":"2010-09-28T16:31:35Z","abstract_excerpt":"An n-town, for a natural number n, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings along the axis-parallel street grid, then an n-town has optimal shape if the sum of all pairwise Manhattan distances is minimized. This problem has been studied for cities, i.e., the limiting case of very large n. For cities, it is known that the optimal shape can be described by a differential equation, for which no closed-form is known. We show that optimal n-towns can be computed in O(n^7.5) time. This is also prac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5628","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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q9884OvIvBKbcSbuHc/JlKRpze+gwahG5gqU2Ta5+CH+bhNTQskMzs2FmJhRr+aI65Mz3cwXCg+dupvOpcmfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:14:01.097907Z"},"content_sha256":"9f667eb3135ba04e0176ee909c408ec2b5d8db5bdd455eb1029ceeb16d1ba008","schema_version":"1.0","event_id":"sha256:9f667eb3135ba04e0176ee909c408ec2b5d8db5bdd455eb1029ceeb16d1ba008"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QO4CHCJF3L6CMWAXMYOC3Q63AM/bundle.json","state_url":"https://pith.science/pith/QO4CHCJF3L6CMWAXMYOC3Q63AM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QO4CHCJF3L6CMWAXMYOC3Q63AM/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-21T19:14:01Z","links":{"resolver":"https://pith.science/pith/QO4CHCJF3L6CMWAXMYOC3Q63AM","bundle":"https://pith.science/pith/QO4CHCJF3L6CMWAXMYOC3Q63AM/bundle.json","state":"https://pith.science/pith/QO4CHCJF3L6CMWAXMYOC3Q63AM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QO4CHCJF3L6CMWAXMYOC3Q63AM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QO4CHCJF3L6CMWAXMYOC3Q63AM","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":"31a0d9de874afde13cf00202fc66aa02e83ea403b99ccd91db0f23d17d0faf1c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-09-28T16:31:35Z","title_canon_sha256":"3744ee4a5096ffd61df42887b9e7ccab6b734e8717d339b5a187784949be46fe"},"schema_version":"1.0","source":{"id":"1009.5628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5628","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5628v1","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5628","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"QO4CHCJF3L6C","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QO4CHCJF3L6CMWAX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QO4CHCJF","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:9f667eb3135ba04e0176ee909c408ec2b5d8db5bdd455eb1029ceeb16d1ba008","target":"graph","created_at":"2026-05-18T00:30:22Z","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 n-town, for a natural number n, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings along the axis-parallel street grid, then an n-town has optimal shape if the sum of all pairwise Manhattan distances is minimized. This problem has been studied for cities, i.e., the limiting case of very large n. For cities, it is known that the optimal shape can be described by a differential equation, for which no closed-form is known. We show that optimal n-towns can be computed in O(n^7.5) time. This is also prac","authors_text":"Daria Schymura, Erik D. Demaine, Guenter Rote, Mariano Zelke, Nils Schweer, Sandor P. Fekete","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-09-28T16:31:35Z","title":"Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5628","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:c6b906384fddd34bfd89b9f238c111581ed26b92bcf0e0516a83ccd548813117","target":"record","created_at":"2026-05-18T00:30:22Z","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":"31a0d9de874afde13cf00202fc66aa02e83ea403b99ccd91db0f23d17d0faf1c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-09-28T16:31:35Z","title_canon_sha256":"3744ee4a5096ffd61df42887b9e7ccab6b734e8717d339b5a187784949be46fe"},"schema_version":"1.0","source":{"id":"1009.5628","kind":"arxiv","version":1}},"canonical_sha256":"83b8238925dafc265817661c2dc3db032a18b745cce1e2d078a134a9f6971a3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83b8238925dafc265817661c2dc3db032a18b745cce1e2d078a134a9f6971a3f","first_computed_at":"2026-05-18T00:30:22.930035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:22.930035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OPHaPCsLPJPEbH87CYw/NvCDrXCGrgDou7Nhx0AfXA4ZC/yvssvIS34xVMwgztaMv/rpBuRpFS+jykofOQbdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:22.930797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6b906384fddd34bfd89b9f238c111581ed26b92bcf0e0516a83ccd548813117","sha256:9f667eb3135ba04e0176ee909c408ec2b5d8db5bdd455eb1029ceeb16d1ba008"],"state_sha256":"b5104002d9953a646c6fc5e9964d0fff0e168ccd9a98492220e756010028bc71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RC/igHrwhFkBwrIMoa8ndbOGgz1cT273LtB5heXsR8nRQ9ALIHrurZ1J7QOkFaHN6sRDIu69aoqRgkfJUZDMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:14:01.099982Z","bundle_sha256":"c31e8f9cb3543fb90aa3dd793fb1950af27e52396c61714719060a848f426df9"}}