{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YOPXSSGLLC6HTT37MKTBEK7ONV","short_pith_number":"pith:YOPXSSGL","schema_version":"1.0","canonical_sha256":"c39f7948cb58bc79cf7f62a6122bee6d5cbb567e9ffb2519f26df85d383d4de4","source":{"kind":"arxiv","id":"1312.0825","version":1},"attestation_state":"computed","paper":{"title":"FRANTIC: A Fast Reference-based Algorithm for Network Tomography via Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Mayank Bakshi, Minghua Chen, Sheng Cai, Sidharth Jaggi","submitted_at":"2013-12-03T13:57:02Z","abstract_excerpt":"We study the problem of link and node delay estimation in undirected networks when at most k out of n links or nodes in the network are congested. Our approach relies on end-to-end measurements of path delays across pre-specified paths in the network. We present a class of algorithms that we call FRANTIC. The FRANTIC algorithms are motivated by compressive sensing; however, unlike traditional compressive sensing, the measurement design here is constrained by the network topology and the matrix entries are constrained to be positive integers. A key component of our design is a new compressive s"},"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":"1312.0825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-03T13:57:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"19d8fcbddb7c85e951ad549c1c04e8cfd88e9b9568454b00839c0ddc906b95fb","abstract_canon_sha256":"e0a0d0e40127d1e7e97c879a108fc9364d85411a671f08ca8ac28bc338f9bbb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.490228Z","signature_b64":"TR27n2Bs0Tm2jM1T7FxJ+ZOWxTn3jxQLkLwC754u9Z7MpYVQ3egeGQcXNF62IgmIFwcCi20TCLpgQqIUWk9mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c39f7948cb58bc79cf7f62a6122bee6d5cbb567e9ffb2519f26df85d383d4de4","last_reissued_at":"2026-05-18T00:57:52.489533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.489533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FRANTIC: A Fast Reference-based Algorithm for Network Tomography via Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Mayank Bakshi, Minghua Chen, Sheng Cai, Sidharth Jaggi","submitted_at":"2013-12-03T13:57:02Z","abstract_excerpt":"We study the problem of link and node delay estimation in undirected networks when at most k out of n links or nodes in the network are congested. Our approach relies on end-to-end measurements of path delays across pre-specified paths in the network. We present a class of algorithms that we call FRANTIC. The FRANTIC algorithms are motivated by compressive sensing; however, unlike traditional compressive sensing, the measurement design here is constrained by the network topology and the matrix entries are constrained to be positive integers. A key component of our design is a new compressive s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0825","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":"1312.0825","created_at":"2026-05-18T00:57:52.489635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0825v1","created_at":"2026-05-18T00:57:52.489635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0825","created_at":"2026-05-18T00:57:52.489635+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOPXSSGLLC6H","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOPXSSGLLC6HTT37","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOPXSSGL","created_at":"2026-05-18T12:28:06.772260+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/YOPXSSGLLC6HTT37MKTBEK7ONV","json":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV.json","graph_json":"https://pith.science/api/pith-number/YOPXSSGLLC6HTT37MKTBEK7ONV/graph.json","events_json":"https://pith.science/api/pith-number/YOPXSSGLLC6HTT37MKTBEK7ONV/events.json","paper":"https://pith.science/paper/YOPXSSGL"},"agent_actions":{"view_html":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV","download_json":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV.json","view_paper":"https://pith.science/paper/YOPXSSGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0825&json=true","fetch_graph":"https://pith.science/api/pith-number/YOPXSSGLLC6HTT37MKTBEK7ONV/graph.json","fetch_events":"https://pith.science/api/pith-number/YOPXSSGLLC6HTT37MKTBEK7ONV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/action/storage_attestation","attest_author":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/action/author_attestation","sign_citation":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/action/citation_signature","submit_replication":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/action/replication_record"}},"created_at":"2026-05-18T00:57:52.489635+00:00","updated_at":"2026-05-18T00:57:52.489635+00:00"}