{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S5PGIMYWKKEJVPDSYXFYT5SJAS","short_pith_number":"pith:S5PGIMYW","canonical_record":{"source":{"id":"1710.03852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T23:00:38Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"f48cfb47a4ee0c2f170179abeb8bb17d68c55ef153a73a21296e9e266eee5697","abstract_canon_sha256":"70ebc61d7d5407ad159c48143d44b1b54ea055492918f4b895ec3aae7afb89e6"},"schema_version":"1.0"},"canonical_sha256":"975e64331652889abc72c5cb89f649048d075f7de34b7ec494240e0f69caf74b","source":{"kind":"arxiv","id":"1710.03852","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03852","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03852v2","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03852","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"S5PGIMYWKKEJ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S5PGIMYWKKEJVPDS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S5PGIMYW","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S5PGIMYWKKEJVPDSYXFYT5SJAS","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03852","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T23:00:38Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"f48cfb47a4ee0c2f170179abeb8bb17d68c55ef153a73a21296e9e266eee5697","abstract_canon_sha256":"70ebc61d7d5407ad159c48143d44b1b54ea055492918f4b895ec3aae7afb89e6"},"schema_version":"1.0"},"canonical_sha256":"975e64331652889abc72c5cb89f649048d075f7de34b7ec494240e0f69caf74b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:43.802239Z","signature_b64":"rfPd2K/T/CDWD/vyiPgDuQ+lOrPdyUWGnjIoX6ot+iu4FQ2liwtqQME06aT+Ur3mF468LyV/A0nJ1o0zD8cCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"975e64331652889abc72c5cb89f649048d075f7de34b7ec494240e0f69caf74b","last_reissued_at":"2026-05-18T00:01:43.801613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:43.801613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03852","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:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JFt4qgvhjo4dYGBcRpimSlfm9c23j9YbHkGezIoZ0QUGVInfPuOQ4ATMlHr6LqljTQEN0KlJpN6Njjvl+8aBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:16:55.984146Z"},"content_sha256":"4aef1de6fd2d15a53d1c2528f9c73201f2d33c98a7ee64e7f8b1870595a2d1eb","schema_version":"1.0","event_id":"sha256:4aef1de6fd2d15a53d1c2528f9c73201f2d33c98a7ee64e7f8b1870595a2d1eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S5PGIMYWKKEJVPDSYXFYT5SJAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top-k Route Search through Submodularity Modeling of Recurrent POI Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.SI","authors_text":"Hongwei Liang, Ke Wang","submitted_at":"2017-10-10T23:00:38Z","abstract_excerpt":"We consider a practical top-k route search problem: given a collection of points of interest (POIs) with rated features and traveling costs between POIs, a user wants to find k routes from a source to a destination and limited in a cost budget, that maximally match her needs on feature preferences. One challenge is dealing with the personalized diversity requirement where users have various trade-off between quantity (the number of POIs with a specified feature) and variety (the coverage of specified features). Another challenge is the large scale of the POI map and the great many alternative "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03852","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:01:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oL7htejCMuvt4Ix/fhcVxVrD1Y7SUFnxDI+g6IXOit9S+/l5PNvKaQlxyxIIJDmU0yLZFpDMuEarPzELSNwjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:16:55.989695Z"},"content_sha256":"470367bf1b6975b052c094b3010ee52d0a6684b5e6a9d7cfdaffd57200faa5bd","schema_version":"1.0","event_id":"sha256:470367bf1b6975b052c094b3010ee52d0a6684b5e6a9d7cfdaffd57200faa5bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5PGIMYWKKEJVPDSYXFYT5SJAS/bundle.json","state_url":"https://pith.science/pith/S5PGIMYWKKEJVPDSYXFYT5SJAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5PGIMYWKKEJVPDSYXFYT5SJAS/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-08-14T00:16:56Z","links":{"resolver":"https://pith.science/pith/S5PGIMYWKKEJVPDSYXFYT5SJAS","bundle":"https://pith.science/pith/S5PGIMYWKKEJVPDSYXFYT5SJAS/bundle.json","state":"https://pith.science/pith/S5PGIMYWKKEJVPDSYXFYT5SJAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5PGIMYWKKEJVPDSYXFYT5SJAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S5PGIMYWKKEJVPDSYXFYT5SJAS","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":"70ebc61d7d5407ad159c48143d44b1b54ea055492918f4b895ec3aae7afb89e6","cross_cats_sorted":["cs.DB","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T23:00:38Z","title_canon_sha256":"f48cfb47a4ee0c2f170179abeb8bb17d68c55ef153a73a21296e9e266eee5697"},"schema_version":"1.0","source":{"id":"1710.03852","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03852","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03852v2","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03852","created_at":"2026-05-18T00:01:43Z"},{"alias_kind":"pith_short_12","alias_value":"S5PGIMYWKKEJ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S5PGIMYWKKEJVPDS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S5PGIMYW","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:470367bf1b6975b052c094b3010ee52d0a6684b5e6a9d7cfdaffd57200faa5bd","target":"graph","created_at":"2026-05-18T00:01:43Z","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 a practical top-k route search problem: given a collection of points of interest (POIs) with rated features and traveling costs between POIs, a user wants to find k routes from a source to a destination and limited in a cost budget, that maximally match her needs on feature preferences. One challenge is dealing with the personalized diversity requirement where users have various trade-off between quantity (the number of POIs with a specified feature) and variety (the coverage of specified features). Another challenge is the large scale of the POI map and the great many alternative ","authors_text":"Hongwei Liang, Ke Wang","cross_cats":["cs.DB","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T23:00:38Z","title":"Top-k Route Search through Submodularity Modeling of Recurrent POI Features"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03852","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:4aef1de6fd2d15a53d1c2528f9c73201f2d33c98a7ee64e7f8b1870595a2d1eb","target":"record","created_at":"2026-05-18T00:01:43Z","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":"70ebc61d7d5407ad159c48143d44b1b54ea055492918f4b895ec3aae7afb89e6","cross_cats_sorted":["cs.DB","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-10-10T23:00:38Z","title_canon_sha256":"f48cfb47a4ee0c2f170179abeb8bb17d68c55ef153a73a21296e9e266eee5697"},"schema_version":"1.0","source":{"id":"1710.03852","kind":"arxiv","version":2}},"canonical_sha256":"975e64331652889abc72c5cb89f649048d075f7de34b7ec494240e0f69caf74b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"975e64331652889abc72c5cb89f649048d075f7de34b7ec494240e0f69caf74b","first_computed_at":"2026-05-18T00:01:43.801613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:43.801613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rfPd2K/T/CDWD/vyiPgDuQ+lOrPdyUWGnjIoX6ot+iu4FQ2liwtqQME06aT+Ur3mF468LyV/A0nJ1o0zD8cCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:43.802239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03852","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4aef1de6fd2d15a53d1c2528f9c73201f2d33c98a7ee64e7f8b1870595a2d1eb","sha256:470367bf1b6975b052c094b3010ee52d0a6684b5e6a9d7cfdaffd57200faa5bd"],"state_sha256":"d7450a65e1dffcdb35ed2bd50a9c8d0005ffb0e48f76895403e1c8a99c1fe0ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhfPvn5y4b1sntqbwDYWmad9R1kjGN8P4mQPLVaZUw1trrC2nFFXU842pUwE1Ed4EmWtdh9Mnj1uvKaB+oqxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T00:16:56.005875Z","bundle_sha256":"50d8605a478ace382f8cb881ffbec5c91a4ecf0feac07b3fb974059c0f600647"}}