{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YOPXSSGLLC6HTT37MKTBEK7ONV","short_pith_number":"pith:YOPXSSGL","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"},"canonical_sha256":"c39f7948cb58bc79cf7f62a6122bee6d5cbb567e9ffb2519f26df85d383d4de4","source":{"kind":"arxiv","id":"1312.0825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0825","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0825v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0825","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"YOPXSSGLLC6H","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YOPXSSGLLC6HTT37","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YOPXSSGL","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YOPXSSGLLC6HTT37MKTBEK7ONV","target":"record","payload":{"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"},"canonical_sha256":"c39f7948cb58bc79cf7f62a6122bee6d5cbb567e9ffb2519f26df85d383d4de4","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"},"source_kind":"arxiv","source_id":"1312.0825","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0n0HwRYLDoNItrJ9U9Z8sOWiFNTeBmFW30wtxMtm2pTXWcyYapGUTGximv59JdIjaVJX6UrNwZOxb/GLJF/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:36.829176Z"},"content_sha256":"159d5d64a1d9a5d2ebfae44d6d9a7a4db99cf30c576d362a8cd91af2e3895f22","schema_version":"1.0","event_id":"sha256:159d5d64a1d9a5d2ebfae44d6d9a7a4db99cf30c576d362a8cd91af2e3895f22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YOPXSSGLLC6HTT37MKTBEK7ONV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyvhBsr5p55sSnLZO37axqe//qKeVAbyJkWR5e9LY+vPLdhSFZjhysv/q2faoOePZQnbhGqVg0kQ1zCDAGQPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:36.829891Z"},"content_sha256":"d86ddb45690eee58a57c0594cad45da7a516e95ea886ee48b104bae9bf5911d9","schema_version":"1.0","event_id":"sha256:d86ddb45690eee58a57c0594cad45da7a516e95ea886ee48b104bae9bf5911d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/bundle.json","state_url":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T18:59:36Z","links":{"resolver":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV","bundle":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/bundle.json","state":"https://pith.science/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOPXSSGLLC6HTT37MKTBEK7ONV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YOPXSSGLLC6HTT37MKTBEK7ONV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e0a0d0e40127d1e7e97c879a108fc9364d85411a671f08ca8ac28bc338f9bbb7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-03T13:57:02Z","title_canon_sha256":"19d8fcbddb7c85e951ad549c1c04e8cfd88e9b9568454b00839c0ddc906b95fb"},"schema_version":"1.0","source":{"id":"1312.0825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0825","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0825v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0825","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"YOPXSSGLLC6H","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YOPXSSGLLC6HTT37","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YOPXSSGL","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:d86ddb45690eee58a57c0594cad45da7a516e95ea886ee48b104bae9bf5911d9","target":"graph","created_at":"2026-05-18T00:57:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Mayank Bakshi, Minghua Chen, Sheng Cai, Sidharth Jaggi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-03T13:57:02Z","title":"FRANTIC: A Fast Reference-based Algorithm for Network Tomography via Compressive Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0825","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:159d5d64a1d9a5d2ebfae44d6d9a7a4db99cf30c576d362a8cd91af2e3895f22","target":"record","created_at":"2026-05-18T00:57:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e0a0d0e40127d1e7e97c879a108fc9364d85411a671f08ca8ac28bc338f9bbb7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-03T13:57:02Z","title_canon_sha256":"19d8fcbddb7c85e951ad549c1c04e8cfd88e9b9568454b00839c0ddc906b95fb"},"schema_version":"1.0","source":{"id":"1312.0825","kind":"arxiv","version":1}},"canonical_sha256":"c39f7948cb58bc79cf7f62a6122bee6d5cbb567e9ffb2519f26df85d383d4de4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c39f7948cb58bc79cf7f62a6122bee6d5cbb567e9ffb2519f26df85d383d4de4","first_computed_at":"2026-05-18T00:57:52.489533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:52.489533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TR27n2Bs0Tm2jM1T7FxJ+ZOWxTn3jxQLkLwC754u9Z7MpYVQ3egeGQcXNF62IgmIFwcCi20TCLpgQqIUWk9mBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:52.490228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:159d5d64a1d9a5d2ebfae44d6d9a7a4db99cf30c576d362a8cd91af2e3895f22","sha256:d86ddb45690eee58a57c0594cad45da7a516e95ea886ee48b104bae9bf5911d9"],"state_sha256":"c1e373fb78efbfd4811229933fefc7827c48ab67cec951c45b21f22ac60e5eba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2wXPghpZ3B6nEfnx37WGNmD3Y2fIp6qBuZ2z1wjFnsGBn2p7G3sHpTisqcx6fuYdX/0DQ0SIDpVtHuv2cSNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:59:36.833664Z","bundle_sha256":"2b549467e47d5c99bdec2eec0c4428ec2b5f14145b54e2524ece284d01768cef"}}