{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CM7KHCYQDUT36UEXKEYCWDXMU3","short_pith_number":"pith:CM7KHCYQ","schema_version":"1.0","canonical_sha256":"133ea38b101d27bf509751302b0eeca6e96dbc1abaa758bd4b9e068f0ded751c","source":{"kind":"arxiv","id":"2412.03715","version":1},"attestation_state":"computed","paper":{"title":"PathletRL++: Optimizing Trajectory Pathlet Extraction and Dictionary Formation via Reinforcement Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Arian Haghparast, Gian Alix, Manos Papagelis","submitted_at":"2024-12-04T21:09:43Z","abstract_excerpt":"Advances in tracking technologies have spurred the rapid growth of large-scale trajectory data. Building a compact collection of pathlets, referred to as a trajectory pathlet dictionary, is essential for supporting mobility-related applications. Existing methods typically adopt a top-down approach, generating numerous candidate pathlets and selecting a subset, leading to high memory usage and redundant storage from overlapping pathlets. To overcome these limitations, we propose a bottom-up strategy that incrementally merges basic pathlets to build the dictionary, reducing memory requirements b"},"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":"2412.03715","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-04T21:09:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5427c06ff0fe08589a186a0384f0116dda2dd82a2ad26e809145a5cdab60a10a","abstract_canon_sha256":"543fc0901dfccaed53e08bf06a6e9f4f5b57f002cddf703102367888d91d21a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:40.333097Z","signature_b64":"e6oxozOPzegnC5cXnarvxXY516lk9iDuaJRm1m9x/A9XmrwdD7Jj/cv8aYGuLP2rRUJjiuhMcb9VfPS0j+WdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"133ea38b101d27bf509751302b0eeca6e96dbc1abaa758bd4b9e068f0ded751c","last_reissued_at":"2026-07-05T09:44:40.332612Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:40.332612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PathletRL++: Optimizing Trajectory Pathlet Extraction and Dictionary Formation via Reinforcement Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Arian Haghparast, Gian Alix, Manos Papagelis","submitted_at":"2024-12-04T21:09:43Z","abstract_excerpt":"Advances in tracking technologies have spurred the rapid growth of large-scale trajectory data. Building a compact collection of pathlets, referred to as a trajectory pathlet dictionary, is essential for supporting mobility-related applications. Existing methods typically adopt a top-down approach, generating numerous candidate pathlets and selecting a subset, leading to high memory usage and redundant storage from overlapping pathlets. To overcome these limitations, we propose a bottom-up strategy that incrementally merges basic pathlets to build the dictionary, reducing memory requirements b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03715","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.03715/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.03715","created_at":"2026-07-05T09:44:40.332671+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03715v1","created_at":"2026-07-05T09:44:40.332671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03715","created_at":"2026-07-05T09:44:40.332671+00:00"},{"alias_kind":"pith_short_12","alias_value":"CM7KHCYQDUT3","created_at":"2026-07-05T09:44:40.332671+00:00"},{"alias_kind":"pith_short_16","alias_value":"CM7KHCYQDUT36UEX","created_at":"2026-07-05T09:44:40.332671+00:00"},{"alias_kind":"pith_short_8","alias_value":"CM7KHCYQ","created_at":"2026-07-05T09:44:40.332671+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/CM7KHCYQDUT36UEXKEYCWDXMU3","json":"https://pith.science/pith/CM7KHCYQDUT36UEXKEYCWDXMU3.json","graph_json":"https://pith.science/api/pith-number/CM7KHCYQDUT36UEXKEYCWDXMU3/graph.json","events_json":"https://pith.science/api/pith-number/CM7KHCYQDUT36UEXKEYCWDXMU3/events.json","paper":"https://pith.science/paper/CM7KHCYQ"},"agent_actions":{"view_html":"https://pith.science/pith/CM7KHCYQDUT36UEXKEYCWDXMU3","download_json":"https://pith.science/pith/CM7KHCYQDUT36UEXKEYCWDXMU3.json","view_paper":"https://pith.science/paper/CM7KHCYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03715&json=true","fetch_graph":"https://pith.science/api/pith-number/CM7KHCYQDUT36UEXKEYCWDXMU3/graph.json","fetch_events":"https://pith.science/api/pith-number/CM7KHCYQDUT36UEXKEYCWDXMU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CM7KHCYQDUT36UEXKEYCWDXMU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CM7KHCYQDUT36UEXKEYCWDXMU3/action/storage_attestation","attest_author":"https://pith.science/pith/CM7KHCYQDUT36UEXKEYCWDXMU3/action/author_attestation","sign_citation":"https://pith.science/pith/CM7KHCYQDUT36UEXKEYCWDXMU3/action/citation_signature","submit_replication":"https://pith.science/pith/CM7KHCYQDUT36UEXKEYCWDXMU3/action/replication_record"}},"created_at":"2026-07-05T09:44:40.332671+00:00","updated_at":"2026-07-05T09:44:40.332671+00:00"}