{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YM7PEURAKWKFV4MSWJFPNFKCR5","short_pith_number":"pith:YM7PEURA","schema_version":"1.0","canonical_sha256":"c33ef2522055945af192b24af695428f65e078a3c2f9f160655c51aff6a163be","source":{"kind":"arxiv","id":"1704.07405","version":1},"attestation_state":"computed","paper":{"title":"The Flexible Group Spatial Keyword Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Egemen Tanin, Jianzhong Qi, Mohammed Eunus Ali, Peter Scheuermann, Rafi Kamal, Sabbir Ahmad","submitted_at":"2017-04-24T18:33:50Z","abstract_excerpt":"We present a new class of service for location based social networks, called the Flexible Group Spatial Keyword Query, which enables a group of users to collectively find a point of interest (POI) that optimizes an aggregate cost function combining both spatial distances and keyword similarities. In addition, our query service allows users to consider the tradeoffs between obtaining a sub-optimal solution for the entire group and obtaining an optimimized solution but only for a subgroup.\n  We propose algorithms to process three variants of the query: (i) the group nearest neighbor with keyword"},"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":"1704.07405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-04-24T18:33:50Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0f13e6ab2d0ca8004a79b4e2873f5b1df810648e8854786d6c6244bbf10201d6","abstract_canon_sha256":"4efe34a3fc32781972398a952471f732409c10d70cb94d08327c0a559fd2739f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:38.206766Z","signature_b64":"0GMGJznrq6y8nPlIr4zGusf+QWq2OJshubg2+esGTWj0HzE37O8ybM9IZaLfYWeaTq/ZFIsLYVR9qDJzDd6XBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c33ef2522055945af192b24af695428f65e078a3c2f9f160655c51aff6a163be","last_reissued_at":"2026-05-18T00:45:38.205744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:38.205744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Flexible Group Spatial Keyword Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Egemen Tanin, Jianzhong Qi, Mohammed Eunus Ali, Peter Scheuermann, Rafi Kamal, Sabbir Ahmad","submitted_at":"2017-04-24T18:33:50Z","abstract_excerpt":"We present a new class of service for location based social networks, called the Flexible Group Spatial Keyword Query, which enables a group of users to collectively find a point of interest (POI) that optimizes an aggregate cost function combining both spatial distances and keyword similarities. In addition, our query service allows users to consider the tradeoffs between obtaining a sub-optimal solution for the entire group and obtaining an optimimized solution but only for a subgroup.\n  We propose algorithms to process three variants of the query: (i) the group nearest neighbor with keyword"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07405","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":"1704.07405","created_at":"2026-05-18T00:45:38.206122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07405v1","created_at":"2026-05-18T00:45:38.206122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07405","created_at":"2026-05-18T00:45:38.206122+00:00"},{"alias_kind":"pith_short_12","alias_value":"YM7PEURAKWKF","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YM7PEURAKWKFV4MS","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YM7PEURA","created_at":"2026-05-18T12:31:56.362134+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/YM7PEURAKWKFV4MSWJFPNFKCR5","json":"https://pith.science/pith/YM7PEURAKWKFV4MSWJFPNFKCR5.json","graph_json":"https://pith.science/api/pith-number/YM7PEURAKWKFV4MSWJFPNFKCR5/graph.json","events_json":"https://pith.science/api/pith-number/YM7PEURAKWKFV4MSWJFPNFKCR5/events.json","paper":"https://pith.science/paper/YM7PEURA"},"agent_actions":{"view_html":"https://pith.science/pith/YM7PEURAKWKFV4MSWJFPNFKCR5","download_json":"https://pith.science/pith/YM7PEURAKWKFV4MSWJFPNFKCR5.json","view_paper":"https://pith.science/paper/YM7PEURA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07405&json=true","fetch_graph":"https://pith.science/api/pith-number/YM7PEURAKWKFV4MSWJFPNFKCR5/graph.json","fetch_events":"https://pith.science/api/pith-number/YM7PEURAKWKFV4MSWJFPNFKCR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YM7PEURAKWKFV4MSWJFPNFKCR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YM7PEURAKWKFV4MSWJFPNFKCR5/action/storage_attestation","attest_author":"https://pith.science/pith/YM7PEURAKWKFV4MSWJFPNFKCR5/action/author_attestation","sign_citation":"https://pith.science/pith/YM7PEURAKWKFV4MSWJFPNFKCR5/action/citation_signature","submit_replication":"https://pith.science/pith/YM7PEURAKWKFV4MSWJFPNFKCR5/action/replication_record"}},"created_at":"2026-05-18T00:45:38.206122+00:00","updated_at":"2026-05-18T00:45:38.206122+00:00"}