{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6XE5TQNEURDTUG4ZAOT2TXN2ZD","short_pith_number":"pith:6XE5TQNE","canonical_record":{"source":{"id":"1208.0073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:42:19Z","cross_cats_sorted":[],"title_canon_sha256":"dd65ce91ff90aa1edb057be2a6d8e4fc83c76b862c86760d319838c80d1fd3bb","abstract_canon_sha256":"1cc449a1ac1f2a9cc381e5ccf34489b53a7aa1ace9b4897c2c7bb5c919fb30fc"},"schema_version":"1.0"},"canonical_sha256":"f5c9d9c1a4a4473a1b9903a7a9ddbac8f451b8f805e6fa6a7f532a632a2fbeb2","source":{"kind":"arxiv","id":"1208.0073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0073","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0073v1","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0073","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"6XE5TQNEURDT","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6XE5TQNEURDTUG4Z","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6XE5TQNE","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6XE5TQNEURDTUG4ZAOT2TXN2ZD","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:42:19Z","cross_cats_sorted":[],"title_canon_sha256":"dd65ce91ff90aa1edb057be2a6d8e4fc83c76b862c86760d319838c80d1fd3bb","abstract_canon_sha256":"1cc449a1ac1f2a9cc381e5ccf34489b53a7aa1ace9b4897c2c7bb5c919fb30fc"},"schema_version":"1.0"},"canonical_sha256":"f5c9d9c1a4a4473a1b9903a7a9ddbac8f451b8f805e6fa6a7f532a632a2fbeb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:45.108274Z","signature_b64":"AKIOgkuxu3QXrTHjyHz8i55R3LLHmtf5lYW+PnAWHgMv7dRGpVaUtfhINLLZksNAxFrxgKOAqga5iijqZU3sAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5c9d9c1a4a4473a1b9903a7a9ddbac8f451b8f805e6fa6a7f532a632a2fbeb2","last_reissued_at":"2026-05-18T03:49:45.107482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:45.107482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0073","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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNH24hqVoIYmGZb7nK1F0PIYo8kNHYs0XphU1fD89k7uunu9ET9mZGwJN8c+vL15sdvED6JEDrx8i9o3EBRcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:12:02.719806Z"},"content_sha256":"018d22988526443c7fcdaba591d0469e80fab6ea4f4dcfbe69bd2e8f4313e552","schema_version":"1.0","event_id":"sha256:018d22988526443c7fcdaba591d0469e80fab6ea4f4dcfbe69bd2e8f4313e552"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6XE5TQNEURDTUG4ZAOT2TXN2ZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Algorithm for Maximizing Range Sum in Spatial Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chin-Wan Chung, Dong-Wan Choi, Yufei Tao","submitted_at":"2012-08-01T03:42:19Z","abstract_excerpt":"This paper investigates the MaxRS problem in spatial databases. Given a set O of weighted points and a rectangular region r of a given size, the goal of the MaxRS problem is to find a location of r such that the sum of the weights of all the points covered by r is maximized. This problem is useful in many location-based applications such as finding the best place for a new franchise store with a limited delivery range and finding the most attractive place for a tourist with a limited reachable range. However, the problem has been studied mainly in theory, particularly, in computational geometr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0073","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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3p9PmUDkEKFIISNSHrb8SN5TQzZJLub/ynHUXKWn8XLbu7DHxJzjzSIXu+cGs4wdG0ZWT/absxym7iB6sw9dDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:12:02.720145Z"},"content_sha256":"af5917a6d9692d3b1844d18c5c8427ffc80aa9ec6935dcaa0a053e04b42aa845","schema_version":"1.0","event_id":"sha256:af5917a6d9692d3b1844d18c5c8427ffc80aa9ec6935dcaa0a053e04b42aa845"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XE5TQNEURDTUG4ZAOT2TXN2ZD/bundle.json","state_url":"https://pith.science/pith/6XE5TQNEURDTUG4ZAOT2TXN2ZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XE5TQNEURDTUG4ZAOT2TXN2ZD/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-29T13:12:02Z","links":{"resolver":"https://pith.science/pith/6XE5TQNEURDTUG4ZAOT2TXN2ZD","bundle":"https://pith.science/pith/6XE5TQNEURDTUG4ZAOT2TXN2ZD/bundle.json","state":"https://pith.science/pith/6XE5TQNEURDTUG4ZAOT2TXN2ZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XE5TQNEURDTUG4ZAOT2TXN2ZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6XE5TQNEURDTUG4ZAOT2TXN2ZD","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":"1cc449a1ac1f2a9cc381e5ccf34489b53a7aa1ace9b4897c2c7bb5c919fb30fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:42:19Z","title_canon_sha256":"dd65ce91ff90aa1edb057be2a6d8e4fc83c76b862c86760d319838c80d1fd3bb"},"schema_version":"1.0","source":{"id":"1208.0073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0073","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0073v1","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0073","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"6XE5TQNEURDT","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6XE5TQNEURDTUG4Z","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6XE5TQNE","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:af5917a6d9692d3b1844d18c5c8427ffc80aa9ec6935dcaa0a053e04b42aa845","target":"graph","created_at":"2026-05-18T03:49:45Z","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":"This paper investigates the MaxRS problem in spatial databases. Given a set O of weighted points and a rectangular region r of a given size, the goal of the MaxRS problem is to find a location of r such that the sum of the weights of all the points covered by r is maximized. This problem is useful in many location-based applications such as finding the best place for a new franchise store with a limited delivery range and finding the most attractive place for a tourist with a limited reachable range. However, the problem has been studied mainly in theory, particularly, in computational geometr","authors_text":"Chin-Wan Chung, Dong-Wan Choi, Yufei Tao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:42:19Z","title":"A Scalable Algorithm for Maximizing Range Sum in Spatial Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0073","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:018d22988526443c7fcdaba591d0469e80fab6ea4f4dcfbe69bd2e8f4313e552","target":"record","created_at":"2026-05-18T03:49:45Z","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":"1cc449a1ac1f2a9cc381e5ccf34489b53a7aa1ace9b4897c2c7bb5c919fb30fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:42:19Z","title_canon_sha256":"dd65ce91ff90aa1edb057be2a6d8e4fc83c76b862c86760d319838c80d1fd3bb"},"schema_version":"1.0","source":{"id":"1208.0073","kind":"arxiv","version":1}},"canonical_sha256":"f5c9d9c1a4a4473a1b9903a7a9ddbac8f451b8f805e6fa6a7f532a632a2fbeb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5c9d9c1a4a4473a1b9903a7a9ddbac8f451b8f805e6fa6a7f532a632a2fbeb2","first_computed_at":"2026-05-18T03:49:45.107482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:45.107482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AKIOgkuxu3QXrTHjyHz8i55R3LLHmtf5lYW+PnAWHgMv7dRGpVaUtfhINLLZksNAxFrxgKOAqga5iijqZU3sAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:45.108274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:018d22988526443c7fcdaba591d0469e80fab6ea4f4dcfbe69bd2e8f4313e552","sha256:af5917a6d9692d3b1844d18c5c8427ffc80aa9ec6935dcaa0a053e04b42aa845"],"state_sha256":"f78d6f1286f1f20889ea64d49c61e68b0a2ff0e959df5ce50baae99c836cf775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YZ/dPxK6Ap/vquotjKHQOH81/ZIyCKJw9yl1zor8Z7uusXkOSPAlkT3/dKgmxqMT9Lz8oYr/5Yhg+NqlzA9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:12:02.721982Z","bundle_sha256":"ee73ebc9fcb2fe47864d9e5fb502d8abb1d1d2edf662ae2b6c4e1b63a8770a2d"}}