{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EYJ6TPQCXBAXJPGMLPVF4N3LHF","short_pith_number":"pith:EYJ6TPQC","schema_version":"1.0","canonical_sha256":"2613e9be02b84174bccc5bea5e376b397582774626a14f3d225d268ee3c18320","source":{"kind":"arxiv","id":"1711.01329","version":1},"attestation_state":"computed","paper":{"title":"Fast Path Localization on Graphs via Multiscale Viterbi Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Jelena Kova\\v{c}evi\\'c, Mohammad Ali Maddah-Ali, Pulkit Grover, Siheng Chen, Soummya Kar, Yaoqing Yang","submitted_at":"2017-11-03T20:51:34Z","abstract_excerpt":"We consider a problem of localizing a path-signal that evolves over time on a graph. A path-signal can be viewed as the trajectory of a moving agent on a graph in several consecutive time points. Combining dynamic programming and graph partitioning, we propose a path-localization algorithm with significantly reduced computational complexity. We analyze the localization error for the proposed approach both in the Hamming distance and the destination's distance between the path estimate and the true path using numerical bounds. Unlike usual theoretical bounds that only apply to restricted graph "},"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":"1711.01329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-11-03T20:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"421000b66e3dda49a61ea4efaafb3d425e098ea0179de70a934d6021d455e839","abstract_canon_sha256":"308d8f459e3af4db8af39246f4012bcf827f58a0fec27bcda1d53295c91b36b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:59.988167Z","signature_b64":"x8jrH22txy4gDY2+62qXkJzHBsPRrUx8I7gTGl+AImVnLY4dcXBzucW+eWEmEYYJc/rf60aUbFXc9OMTGe77Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2613e9be02b84174bccc5bea5e376b397582774626a14f3d225d268ee3c18320","last_reissued_at":"2026-05-18T00:00:59.987685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:59.987685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Path Localization on Graphs via Multiscale Viterbi Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Jelena Kova\\v{c}evi\\'c, Mohammad Ali Maddah-Ali, Pulkit Grover, Siheng Chen, Soummya Kar, Yaoqing Yang","submitted_at":"2017-11-03T20:51:34Z","abstract_excerpt":"We consider a problem of localizing a path-signal that evolves over time on a graph. A path-signal can be viewed as the trajectory of a moving agent on a graph in several consecutive time points. Combining dynamic programming and graph partitioning, we propose a path-localization algorithm with significantly reduced computational complexity. We analyze the localization error for the proposed approach both in the Hamming distance and the destination's distance between the path estimate and the true path using numerical bounds. Unlike usual theoretical bounds that only apply to restricted graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01329","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":"1711.01329","created_at":"2026-05-18T00:00:59.987757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01329v1","created_at":"2026-05-18T00:00:59.987757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01329","created_at":"2026-05-18T00:00:59.987757+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYJ6TPQCXBAX","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYJ6TPQCXBAXJPGM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYJ6TPQC","created_at":"2026-05-18T12:31:12.930513+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/EYJ6TPQCXBAXJPGMLPVF4N3LHF","json":"https://pith.science/pith/EYJ6TPQCXBAXJPGMLPVF4N3LHF.json","graph_json":"https://pith.science/api/pith-number/EYJ6TPQCXBAXJPGMLPVF4N3LHF/graph.json","events_json":"https://pith.science/api/pith-number/EYJ6TPQCXBAXJPGMLPVF4N3LHF/events.json","paper":"https://pith.science/paper/EYJ6TPQC"},"agent_actions":{"view_html":"https://pith.science/pith/EYJ6TPQCXBAXJPGMLPVF4N3LHF","download_json":"https://pith.science/pith/EYJ6TPQCXBAXJPGMLPVF4N3LHF.json","view_paper":"https://pith.science/paper/EYJ6TPQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01329&json=true","fetch_graph":"https://pith.science/api/pith-number/EYJ6TPQCXBAXJPGMLPVF4N3LHF/graph.json","fetch_events":"https://pith.science/api/pith-number/EYJ6TPQCXBAXJPGMLPVF4N3LHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYJ6TPQCXBAXJPGMLPVF4N3LHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYJ6TPQCXBAXJPGMLPVF4N3LHF/action/storage_attestation","attest_author":"https://pith.science/pith/EYJ6TPQCXBAXJPGMLPVF4N3LHF/action/author_attestation","sign_citation":"https://pith.science/pith/EYJ6TPQCXBAXJPGMLPVF4N3LHF/action/citation_signature","submit_replication":"https://pith.science/pith/EYJ6TPQCXBAXJPGMLPVF4N3LHF/action/replication_record"}},"created_at":"2026-05-18T00:00:59.987757+00:00","updated_at":"2026-05-18T00:00:59.987757+00:00"}