{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4YTCOHAJKHQLBHE7IMUHRJITH6","short_pith_number":"pith:4YTCOHAJ","schema_version":"1.0","canonical_sha256":"e626271c0951e0b09c9f432878a5133fa5890feb8e890457e4b1d0f1e740c8e4","source":{"kind":"arxiv","id":"1812.11249","version":1},"attestation_state":"computed","paper":{"title":"A Compact Representation for Trips over Networks built on self-indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonio Fari\\~na, Daniil Galaktionov, M. Andrea Rodriguez, Nieves R. Brisaboa","submitted_at":"2018-12-28T23:57:14Z","abstract_excerpt":"Representing the movements of objects (trips) over a network in a compact way while retaining the capability of exploiting such data effectively is an important challenge of real applications. We present a new Compact Trip Representation (CTR) that handles the spatio-temporal data associated with users' trips over transportation networks. Depending on the network and types of queries, nodes in the network can represent intersections, stops, or even street segments.\n  CTR represents separately sequences of nodes and the time instants when users traverse these nodes. The spatial component is han"},"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":"1812.11249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-28T23:57:14Z","cross_cats_sorted":[],"title_canon_sha256":"f233c8c88953f051dffbbce2ab4867202d31ca4d337d653e6b60e557d5adc493","abstract_canon_sha256":"2ed8536e6f98edb6b4873dc8448c737221e4115eebe5685d2727022aece27b93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:12.440100Z","signature_b64":"hmdL0ElZkFTXe4uT3WfkcC1Lh2UFBPOWTtptrrhmbNWFtqLEl1YfzXvIeV4Z0XG8ZCCu/Nes7RCwgGKdq1YUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e626271c0951e0b09c9f432878a5133fa5890feb8e890457e4b1d0f1e740c8e4","last_reissued_at":"2026-05-17T23:57:12.439687Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:12.439687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Compact Representation for Trips over Networks built on self-indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonio Fari\\~na, Daniil Galaktionov, M. Andrea Rodriguez, Nieves R. Brisaboa","submitted_at":"2018-12-28T23:57:14Z","abstract_excerpt":"Representing the movements of objects (trips) over a network in a compact way while retaining the capability of exploiting such data effectively is an important challenge of real applications. We present a new Compact Trip Representation (CTR) that handles the spatio-temporal data associated with users' trips over transportation networks. Depending on the network and types of queries, nodes in the network can represent intersections, stops, or even street segments.\n  CTR represents separately sequences of nodes and the time instants when users traverse these nodes. The spatial component is han"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11249","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":"1812.11249","created_at":"2026-05-17T23:57:12.439754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11249v1","created_at":"2026-05-17T23:57:12.439754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11249","created_at":"2026-05-17T23:57:12.439754+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YTCOHAJKHQL","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YTCOHAJKHQLBHE7","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YTCOHAJ","created_at":"2026-05-18T12:32:05.422762+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/4YTCOHAJKHQLBHE7IMUHRJITH6","json":"https://pith.science/pith/4YTCOHAJKHQLBHE7IMUHRJITH6.json","graph_json":"https://pith.science/api/pith-number/4YTCOHAJKHQLBHE7IMUHRJITH6/graph.json","events_json":"https://pith.science/api/pith-number/4YTCOHAJKHQLBHE7IMUHRJITH6/events.json","paper":"https://pith.science/paper/4YTCOHAJ"},"agent_actions":{"view_html":"https://pith.science/pith/4YTCOHAJKHQLBHE7IMUHRJITH6","download_json":"https://pith.science/pith/4YTCOHAJKHQLBHE7IMUHRJITH6.json","view_paper":"https://pith.science/paper/4YTCOHAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11249&json=true","fetch_graph":"https://pith.science/api/pith-number/4YTCOHAJKHQLBHE7IMUHRJITH6/graph.json","fetch_events":"https://pith.science/api/pith-number/4YTCOHAJKHQLBHE7IMUHRJITH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YTCOHAJKHQLBHE7IMUHRJITH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YTCOHAJKHQLBHE7IMUHRJITH6/action/storage_attestation","attest_author":"https://pith.science/pith/4YTCOHAJKHQLBHE7IMUHRJITH6/action/author_attestation","sign_citation":"https://pith.science/pith/4YTCOHAJKHQLBHE7IMUHRJITH6/action/citation_signature","submit_replication":"https://pith.science/pith/4YTCOHAJKHQLBHE7IMUHRJITH6/action/replication_record"}},"created_at":"2026-05-17T23:57:12.439754+00:00","updated_at":"2026-05-17T23:57:12.439754+00:00"}