{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2PDZBJY34SADLHEFVFW6Q6IY5E","short_pith_number":"pith:2PDZBJY3","canonical_record":{"source":{"id":"1903.07118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-17T15:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"70c4533c20602ae8b914f8832bd77a06fe522e4fcafda8634573cb848a92e842","abstract_canon_sha256":"4c3ac65f2a6e32c647a395e9c2a47951875910686fcd82bd433ce2a9f7600be8"},"schema_version":"1.0"},"canonical_sha256":"d3c790a71be480359c85a96de87918e908d21cb5c107ac9001b18be97135cc47","source":{"kind":"arxiv","id":"1903.07118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07118","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07118v1","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07118","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"pith_short_12","alias_value":"2PDZBJY34SAD","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2PDZBJY34SADLHEF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2PDZBJY3","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2PDZBJY34SADLHEFVFW6Q6IY5E","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-17T15:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"70c4533c20602ae8b914f8832bd77a06fe522e4fcafda8634573cb848a92e842","abstract_canon_sha256":"4c3ac65f2a6e32c647a395e9c2a47951875910686fcd82bd433ce2a9f7600be8"},"schema_version":"1.0"},"canonical_sha256":"d3c790a71be480359c85a96de87918e908d21cb5c107ac9001b18be97135cc47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:04.163378Z","signature_b64":"av/WjTKRq/iF8Yi8d7wHd0yfvVwchLzkjGAgLi44sDWDwjbhgMS/dzRTOEZGj8NHjFcwP1YGQSi3kQWBAx/1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3c790a71be480359c85a96de87918e908d21cb5c107ac9001b18be97135cc47","last_reissued_at":"2026-05-17T23:51:04.162887Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:04.162887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07118","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-17T23:51:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYJTBLrcCku+1Z9MSb2iFROJwvx7s9EIxfrj2HEvpfDg1cTdbji46voSIM+O9jdrDMF5Mw1UphWB4t91ZVWZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:36:45.013807Z"},"content_sha256":"d4ae52d5d941cb96fa832641738a402e35804922a7623991cbcb220bda5e31a1","schema_version":"1.0","event_id":"sha256:d4ae52d5d941cb96fa832641738a402e35804922a7623991cbcb220bda5e31a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2PDZBJY34SADLHEFVFW6Q6IY5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topology Discovery Using Path Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anurag Rai, Eytan Modiano","submitted_at":"2019-03-17T15:59:24Z","abstract_excerpt":"We consider the problem of inferring the topology of a network using the measurements available at the end nodes, without cooperation from the internal nodes. To this end, we provide a simple method to obtain path interference which identifies whether two paths in the network intersect with each other. Using this information, we formulate the topology inference problem as an integer program and develop polynomial time algorithms to solve it optimally for networks with tree and ring topologies. Finally, we use the insight developed from these algorithms to develop a heuristic for identifying ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07118","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-17T23:51:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rL6FliGdDGilmVd77kKJFZBRnxKbsubpnY7R1ALle7S3Z/wCX8YmmTTaK52Q36sHtZ0vyKY+/x5RA/+3XvKgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:36:45.014151Z"},"content_sha256":"a98d90127dbd76381b8f92cc20458e86afeb8abde23903a8111c419c1cba1751","schema_version":"1.0","event_id":"sha256:a98d90127dbd76381b8f92cc20458e86afeb8abde23903a8111c419c1cba1751"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PDZBJY34SADLHEFVFW6Q6IY5E/bundle.json","state_url":"https://pith.science/pith/2PDZBJY34SADLHEFVFW6Q6IY5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PDZBJY34SADLHEFVFW6Q6IY5E/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-28T00:36:45Z","links":{"resolver":"https://pith.science/pith/2PDZBJY34SADLHEFVFW6Q6IY5E","bundle":"https://pith.science/pith/2PDZBJY34SADLHEFVFW6Q6IY5E/bundle.json","state":"https://pith.science/pith/2PDZBJY34SADLHEFVFW6Q6IY5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PDZBJY34SADLHEFVFW6Q6IY5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2PDZBJY34SADLHEFVFW6Q6IY5E","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":"4c3ac65f2a6e32c647a395e9c2a47951875910686fcd82bd433ce2a9f7600be8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-17T15:59:24Z","title_canon_sha256":"70c4533c20602ae8b914f8832bd77a06fe522e4fcafda8634573cb848a92e842"},"schema_version":"1.0","source":{"id":"1903.07118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07118","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07118v1","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07118","created_at":"2026-05-17T23:51:04Z"},{"alias_kind":"pith_short_12","alias_value":"2PDZBJY34SAD","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2PDZBJY34SADLHEF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2PDZBJY3","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:a98d90127dbd76381b8f92cc20458e86afeb8abde23903a8111c419c1cba1751","target":"graph","created_at":"2026-05-17T23:51:04Z","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 consider the problem of inferring the topology of a network using the measurements available at the end nodes, without cooperation from the internal nodes. To this end, we provide a simple method to obtain path interference which identifies whether two paths in the network intersect with each other. Using this information, we formulate the topology inference problem as an integer program and develop polynomial time algorithms to solve it optimally for networks with tree and ring topologies. Finally, we use the insight developed from these algorithms to develop a heuristic for identifying ge","authors_text":"Anurag Rai, Eytan Modiano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-17T15:59:24Z","title":"Topology Discovery Using Path Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07118","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:d4ae52d5d941cb96fa832641738a402e35804922a7623991cbcb220bda5e31a1","target":"record","created_at":"2026-05-17T23:51:04Z","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":"4c3ac65f2a6e32c647a395e9c2a47951875910686fcd82bd433ce2a9f7600be8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-17T15:59:24Z","title_canon_sha256":"70c4533c20602ae8b914f8832bd77a06fe522e4fcafda8634573cb848a92e842"},"schema_version":"1.0","source":{"id":"1903.07118","kind":"arxiv","version":1}},"canonical_sha256":"d3c790a71be480359c85a96de87918e908d21cb5c107ac9001b18be97135cc47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3c790a71be480359c85a96de87918e908d21cb5c107ac9001b18be97135cc47","first_computed_at":"2026-05-17T23:51:04.162887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:04.162887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"av/WjTKRq/iF8Yi8d7wHd0yfvVwchLzkjGAgLi44sDWDwjbhgMS/dzRTOEZGj8NHjFcwP1YGQSi3kQWBAx/1DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:04.163378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4ae52d5d941cb96fa832641738a402e35804922a7623991cbcb220bda5e31a1","sha256:a98d90127dbd76381b8f92cc20458e86afeb8abde23903a8111c419c1cba1751"],"state_sha256":"701213377f1aba52d8a94bfebe5a6c167d3fcb963012022afe7b79d1716eb037"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Rp4GDvdB1hgslIlAtQQyK05NyFCNY3WZ+7SyWGlF5Y1VlQL9Z0lfZkZyRjgwclIXXGnsZKt4Q6X6fpxTpJkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:36:45.016109Z","bundle_sha256":"d2060d091eb530acc6167df19394d8d5b2f524e9d3bff980cc72fb71d5cd9bc9"}}