{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:77OQME7LOAOLQLHZTKWQJS4ARD","short_pith_number":"pith:77OQME7L","schema_version":"1.0","canonical_sha256":"ffdd0613eb701cb82cf99aad04cb8088c98dbc0f8353bd434d1dfb81c85c45d7","source":{"kind":"arxiv","id":"1407.2506","version":6},"attestation_state":"computed","paper":{"title":"Discovery of Important Crossroads in Road Network using Massive Taxi Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.AI","authors_text":"Geqi Qi, Haohan Wang, Jianping Wu, Kezhen Hu, Ming Xu, Yiman Du, Yunpeng Xiao","submitted_at":"2014-07-09T14:46:58Z","abstract_excerpt":"A major problem in road network analysis is discovery of important crossroads, which can provide useful information for transport planning. However, none of existing approaches addresses the problem of identifying network-wide important crossroads in real road network. In this paper, we propose a novel data-driven based approach named CRRank to rank important crossroads. Our key innovation is that we model the trip network reflecting real travel demands with a tripartite graph, instead of solely analysis on the topology of road network. To compute the importance scores of crossroads accurately"},"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":"1407.2506","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-09T14:46:58Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"c5525a43f9787bf3c0cb5cf3ec2abafe31a3a78bbd62fbc5f5cedd07a4c19715","abstract_canon_sha256":"ccbab4277b55f189080ecf88d8dae98f36a0d6aaa74b7b023556d8821ebda3ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:10.024960Z","signature_b64":"uxZFGo94rr1sNDhHtdP0tqJKte+2kVFBnTchadD+G5tPiNwN5evZutm5xgUJR26cylN+/upmeXBjf7PLAIyOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffdd0613eb701cb82cf99aad04cb8088c98dbc0f8353bd434d1dfb81c85c45d7","last_reissued_at":"2026-05-18T00:16:10.024376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:10.024376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovery of Important Crossroads in Road Network using Massive Taxi Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.AI","authors_text":"Geqi Qi, Haohan Wang, Jianping Wu, Kezhen Hu, Ming Xu, Yiman Du, Yunpeng Xiao","submitted_at":"2014-07-09T14:46:58Z","abstract_excerpt":"A major problem in road network analysis is discovery of important crossroads, which can provide useful information for transport planning. However, none of existing approaches addresses the problem of identifying network-wide important crossroads in real road network. In this paper, we propose a novel data-driven based approach named CRRank to rank important crossroads. Our key innovation is that we model the trip network reflecting real travel demands with a tripartite graph, instead of solely analysis on the topology of road network. To compute the importance scores of crossroads accurately"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2506","kind":"arxiv","version":6},"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":"1407.2506","created_at":"2026-05-18T00:16:10.024475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2506v6","created_at":"2026-05-18T00:16:10.024475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2506","created_at":"2026-05-18T00:16:10.024475+00:00"},{"alias_kind":"pith_short_12","alias_value":"77OQME7LOAOL","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"77OQME7LOAOLQLHZ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"77OQME7L","created_at":"2026-05-18T12:28:16.859392+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/77OQME7LOAOLQLHZTKWQJS4ARD","json":"https://pith.science/pith/77OQME7LOAOLQLHZTKWQJS4ARD.json","graph_json":"https://pith.science/api/pith-number/77OQME7LOAOLQLHZTKWQJS4ARD/graph.json","events_json":"https://pith.science/api/pith-number/77OQME7LOAOLQLHZTKWQJS4ARD/events.json","paper":"https://pith.science/paper/77OQME7L"},"agent_actions":{"view_html":"https://pith.science/pith/77OQME7LOAOLQLHZTKWQJS4ARD","download_json":"https://pith.science/pith/77OQME7LOAOLQLHZTKWQJS4ARD.json","view_paper":"https://pith.science/paper/77OQME7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2506&json=true","fetch_graph":"https://pith.science/api/pith-number/77OQME7LOAOLQLHZTKWQJS4ARD/graph.json","fetch_events":"https://pith.science/api/pith-number/77OQME7LOAOLQLHZTKWQJS4ARD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77OQME7LOAOLQLHZTKWQJS4ARD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77OQME7LOAOLQLHZTKWQJS4ARD/action/storage_attestation","attest_author":"https://pith.science/pith/77OQME7LOAOLQLHZTKWQJS4ARD/action/author_attestation","sign_citation":"https://pith.science/pith/77OQME7LOAOLQLHZTKWQJS4ARD/action/citation_signature","submit_replication":"https://pith.science/pith/77OQME7LOAOLQLHZTKWQJS4ARD/action/replication_record"}},"created_at":"2026-05-18T00:16:10.024475+00:00","updated_at":"2026-05-18T00:16:10.024475+00:00"}