{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E4ITCYKEFJ57KMUHLRIICQHIOQ","short_pith_number":"pith:E4ITCYKE","canonical_record":{"source":{"id":"1809.07614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-18T03:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"26012b5da629a74f02cf18f8a7ff028461950e123a4e1e43424bf2d73e0cb7eb","abstract_canon_sha256":"80123a71564dd0c6de9c987fcbc1f82f6be09862ffd9edf0e5467cd976906ad5"},"schema_version":"1.0"},"canonical_sha256":"27113161442a7bf532875c508140e8741deae7340ba7f948414e1a1af80ee3e4","source":{"kind":"arxiv","id":"1809.07614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07614","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07614v1","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07614","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"E4ITCYKEFJ57","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E4ITCYKEFJ57KMUH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E4ITCYKE","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E4ITCYKEFJ57KMUHLRIICQHIOQ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-18T03:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"26012b5da629a74f02cf18f8a7ff028461950e123a4e1e43424bf2d73e0cb7eb","abstract_canon_sha256":"80123a71564dd0c6de9c987fcbc1f82f6be09862ffd9edf0e5467cd976906ad5"},"schema_version":"1.0"},"canonical_sha256":"27113161442a7bf532875c508140e8741deae7340ba7f948414e1a1af80ee3e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:15.739196Z","signature_b64":"qbxZxM9Z+jzmXIVhaoKNhm789yFx+HxLRasKS7Ctviq4HDrwpcXR7Rhzww284oN6cCFv31ERCgzRwUG31FlrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27113161442a7bf532875c508140e8741deae7340ba7f948414e1a1af80ee3e4","last_reissued_at":"2026-05-18T00:05:15.738699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:15.738699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07614","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:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xb92ML6VJ0MrjezvNUb0CYmuxJpvOorJX0DEmRKHJOGmC5xrRhbHHk94VOC5SyBeiJSmqjsB/2g0GB3ZLtDnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:29:40.375908Z"},"content_sha256":"42e68d8bf5e50e96063a9af09f567080cd367d12252d3e29f9511fb87d6bef47","schema_version":"1.0","event_id":"sha256:42e68d8bf5e50e96063a9af09f567080cd367d12252d3e29f9511fb87d6bef47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E4ITCYKEFJ57KMUHLRIICQHIOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Approximation Algorithm for Multi-criteria Indoor Route Planning Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Australia), Chaluka Salgado (1), Clayton, David Taniar (1) ((1) Monash University, Muhammad Aamir Cheema (1)","submitted_at":"2018-09-18T03:14:31Z","abstract_excerpt":"A route planning query has many real-world applications and has been studied extensively in outdoor spaces such as road networks or Euclidean space. Despite its many applications in indoor venues (e.g., shopping centres, libraries, airports), almost all existing studies are specifically designed for outdoor spaces and do not take into account unique properties of the indoor spaces such as hallways, stairs, escalators, rooms etc. We identify this research gap and formally define the problem of category aware multi-criteria route planning query, denoted by CAM, which returns the optimal route fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07614","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:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8a5e8jEUJluug1DWu9yKDBo92b7G8l/sjEmmK8f4GOw2dMELVOMvzGYVDf1O4qsxiFDmqaGCJjuhFGDLESUfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:29:40.376637Z"},"content_sha256":"ecf984d924f442eaaacfa98276569e9b6e7d32da0966ffe3ad6636a1544b7322","schema_version":"1.0","event_id":"sha256:ecf984d924f442eaaacfa98276569e9b6e7d32da0966ffe3ad6636a1544b7322"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4ITCYKEFJ57KMUHLRIICQHIOQ/bundle.json","state_url":"https://pith.science/pith/E4ITCYKEFJ57KMUHLRIICQHIOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4ITCYKEFJ57KMUHLRIICQHIOQ/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-05-23T11:29:40Z","links":{"resolver":"https://pith.science/pith/E4ITCYKEFJ57KMUHLRIICQHIOQ","bundle":"https://pith.science/pith/E4ITCYKEFJ57KMUHLRIICQHIOQ/bundle.json","state":"https://pith.science/pith/E4ITCYKEFJ57KMUHLRIICQHIOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4ITCYKEFJ57KMUHLRIICQHIOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E4ITCYKEFJ57KMUHLRIICQHIOQ","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":"80123a71564dd0c6de9c987fcbc1f82f6be09862ffd9edf0e5467cd976906ad5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-18T03:14:31Z","title_canon_sha256":"26012b5da629a74f02cf18f8a7ff028461950e123a4e1e43424bf2d73e0cb7eb"},"schema_version":"1.0","source":{"id":"1809.07614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07614","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07614v1","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07614","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"E4ITCYKEFJ57","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E4ITCYKEFJ57KMUH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E4ITCYKE","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:ecf984d924f442eaaacfa98276569e9b6e7d32da0966ffe3ad6636a1544b7322","target":"graph","created_at":"2026-05-18T00:05:15Z","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":"A route planning query has many real-world applications and has been studied extensively in outdoor spaces such as road networks or Euclidean space. Despite its many applications in indoor venues (e.g., shopping centres, libraries, airports), almost all existing studies are specifically designed for outdoor spaces and do not take into account unique properties of the indoor spaces such as hallways, stairs, escalators, rooms etc. We identify this research gap and formally define the problem of category aware multi-criteria route planning query, denoted by CAM, which returns the optimal route fr","authors_text":"Australia), Chaluka Salgado (1), Clayton, David Taniar (1) ((1) Monash University, Muhammad Aamir Cheema (1)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-18T03:14:31Z","title":"An Efficient Approximation Algorithm for Multi-criteria Indoor Route Planning Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07614","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:42e68d8bf5e50e96063a9af09f567080cd367d12252d3e29f9511fb87d6bef47","target":"record","created_at":"2026-05-18T00:05:15Z","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":"80123a71564dd0c6de9c987fcbc1f82f6be09862ffd9edf0e5467cd976906ad5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-18T03:14:31Z","title_canon_sha256":"26012b5da629a74f02cf18f8a7ff028461950e123a4e1e43424bf2d73e0cb7eb"},"schema_version":"1.0","source":{"id":"1809.07614","kind":"arxiv","version":1}},"canonical_sha256":"27113161442a7bf532875c508140e8741deae7340ba7f948414e1a1af80ee3e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27113161442a7bf532875c508140e8741deae7340ba7f948414e1a1af80ee3e4","first_computed_at":"2026-05-18T00:05:15.738699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:15.738699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qbxZxM9Z+jzmXIVhaoKNhm789yFx+HxLRasKS7Ctviq4HDrwpcXR7Rhzww284oN6cCFv31ERCgzRwUG31FlrCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:15.739196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42e68d8bf5e50e96063a9af09f567080cd367d12252d3e29f9511fb87d6bef47","sha256:ecf984d924f442eaaacfa98276569e9b6e7d32da0966ffe3ad6636a1544b7322"],"state_sha256":"4a90159c7277007b3a1e742b59117448d8a901fdc4c76c5eb7f0634d8ddc8cbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6r5fF1gSUh6G7AUOiLBRuVyTQld882VG/e+tVIPSxwqtF+RyAAnz4ireYQ2PVzulZ+ze/4s+gwdIqvvR/CBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T11:29:40.380307Z","bundle_sha256":"177ee0a25dc3ad258928db7610af7d1f3b18d37ae9797cb8ef17fd892e1d0071"}}