{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:7LYK3MT7FVK7YO5KRPHA5EKRQ3","short_pith_number":"pith:7LYK3MT7","canonical_record":{"source":{"id":"math/0604367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-04-17T11:12:31Z","cross_cats_sorted":["cs.DS","cs.NI","math.ST","stat.TH"],"title_canon_sha256":"21ccc2cb50094b084e917655eca7bd989e055b9e3236f8d0d10c93fa715a1cc8","abstract_canon_sha256":"daa42eef34ff74ae65e0c9062a634e4e759db84f94ce6a4658753b9060984941"},"schema_version":"1.0"},"canonical_sha256":"faf0adb27f2d55fc3baa8bce0e915186f6b58d2d09aaba95c42f3e97da001664","source":{"kind":"arxiv","id":"math/0604367","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0604367","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0604367v2","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0604367","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"7LYK3MT7FVK7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"7LYK3MT7FVK7YO5K","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"7LYK3MT7","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:7LYK3MT7FVK7YO5KRPHA5EKRQ3","target":"record","payload":{"canonical_record":{"source":{"id":"math/0604367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-04-17T11:12:31Z","cross_cats_sorted":["cs.DS","cs.NI","math.ST","stat.TH"],"title_canon_sha256":"21ccc2cb50094b084e917655eca7bd989e055b9e3236f8d0d10c93fa715a1cc8","abstract_canon_sha256":"daa42eef34ff74ae65e0c9062a634e4e759db84f94ce6a4658753b9060984941"},"schema_version":"1.0"},"canonical_sha256":"faf0adb27f2d55fc3baa8bce0e915186f6b58d2d09aaba95c42f3e97da001664","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:05.004460Z","signature_b64":"3hkK5TDjlBGzmlmLiFWHBWsViW/F5I6x0tF3O46RlztwfPLfzmr9TPbAY4srDWrwePmL+8ITmdkckdDyPcCYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faf0adb27f2d55fc3baa8bce0e915186f6b58d2d09aaba95c42f3e97da001664","last_reissued_at":"2026-05-18T04:14:05.003818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:05.003818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0604367","source_version":2,"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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivBTUUSskJy87QoHvAtQ6So8yFHCRPbVcYgun8aaMURbPGOhwi2XUxJnJF4hEUpg63TXUtFs17UvJKB6wPHBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:57:02.921440Z"},"content_sha256":"8972875cc3ea6b7ec00677ce25046f8081d3d40a782eedfaed05350bb1f3ba4b","schema_version":"1.0","event_id":"sha256:8972875cc3ea6b7ec00677ce25046f8081d3d40a782eedfaed05350bb1f3ba4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:7LYK3MT7FVK7YO5KRPHA5EKRQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Delay Inference from Additive Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Ram Rajagopal, Sebastien Roch, Shankar Bhamidi","submitted_at":"2006-04-17T11:12:31Z","abstract_excerpt":"We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multicast-based delay inference, i.e. the problem of reconstructing the topology and delay characteristics of a network from end-to-end delay measurements on network paths. Our inference algorithm is based on additive metric techniques widely used in phylogenetics. It runs in polynomial time and requires a sample of size only $\\poly(\\log n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0604367","kind":"arxiv","version":2},"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-18T04:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVPDdDM8pTzG4J/h3uc0is4Yg57j6HsnoGR5gsbM23daYXAR2L3vBlxyDrtMszL9mTDf4JZgQ6O7BgtlESu+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:57:02.921985Z"},"content_sha256":"95739cbd689772053c7351226d040c13b56648766f30b5b5b666777551912509","schema_version":"1.0","event_id":"sha256:95739cbd689772053c7351226d040c13b56648766f30b5b5b666777551912509"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LYK3MT7FVK7YO5KRPHA5EKRQ3/bundle.json","state_url":"https://pith.science/pith/7LYK3MT7FVK7YO5KRPHA5EKRQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LYK3MT7FVK7YO5KRPHA5EKRQ3/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-28T16:57:02Z","links":{"resolver":"https://pith.science/pith/7LYK3MT7FVK7YO5KRPHA5EKRQ3","bundle":"https://pith.science/pith/7LYK3MT7FVK7YO5KRPHA5EKRQ3/bundle.json","state":"https://pith.science/pith/7LYK3MT7FVK7YO5KRPHA5EKRQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LYK3MT7FVK7YO5KRPHA5EKRQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:7LYK3MT7FVK7YO5KRPHA5EKRQ3","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":"daa42eef34ff74ae65e0c9062a634e4e759db84f94ce6a4658753b9060984941","cross_cats_sorted":["cs.DS","cs.NI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-04-17T11:12:31Z","title_canon_sha256":"21ccc2cb50094b084e917655eca7bd989e055b9e3236f8d0d10c93fa715a1cc8"},"schema_version":"1.0","source":{"id":"math/0604367","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0604367","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0604367v2","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0604367","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"7LYK3MT7FVK7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"7LYK3MT7FVK7YO5K","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"7LYK3MT7","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:95739cbd689772053c7351226d040c13b56648766f30b5b5b666777551912509","target":"graph","created_at":"2026-05-18T04:14:05Z","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 demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multicast-based delay inference, i.e. the problem of reconstructing the topology and delay characteristics of a network from end-to-end delay measurements on network paths. Our inference algorithm is based on additive metric techniques widely used in phylogenetics. It runs in polynomial time and requires a sample of size only $\\poly(\\log n)$.","authors_text":"Ram Rajagopal, Sebastien Roch, Shankar Bhamidi","cross_cats":["cs.DS","cs.NI","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-04-17T11:12:31Z","title":"Network Delay Inference from Additive Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0604367","kind":"arxiv","version":2},"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:8972875cc3ea6b7ec00677ce25046f8081d3d40a782eedfaed05350bb1f3ba4b","target":"record","created_at":"2026-05-18T04:14:05Z","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":"daa42eef34ff74ae65e0c9062a634e4e759db84f94ce6a4658753b9060984941","cross_cats_sorted":["cs.DS","cs.NI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2006-04-17T11:12:31Z","title_canon_sha256":"21ccc2cb50094b084e917655eca7bd989e055b9e3236f8d0d10c93fa715a1cc8"},"schema_version":"1.0","source":{"id":"math/0604367","kind":"arxiv","version":2}},"canonical_sha256":"faf0adb27f2d55fc3baa8bce0e915186f6b58d2d09aaba95c42f3e97da001664","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faf0adb27f2d55fc3baa8bce0e915186f6b58d2d09aaba95c42f3e97da001664","first_computed_at":"2026-05-18T04:14:05.003818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:05.003818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3hkK5TDjlBGzmlmLiFWHBWsViW/F5I6x0tF3O46RlztwfPLfzmr9TPbAY4srDWrwePmL+8ITmdkckdDyPcCYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:05.004460Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0604367","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8972875cc3ea6b7ec00677ce25046f8081d3d40a782eedfaed05350bb1f3ba4b","sha256:95739cbd689772053c7351226d040c13b56648766f30b5b5b666777551912509"],"state_sha256":"593f53b92b033d33d12bfb98f801364370d79cc2a43e516d70e7483ba2520bec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDuD6nn/jtQmNPCydLc0Z0583HkNjnpWmNku8xb+wFGkDoIIvOA1m90iTFK1sGthm6lAJhl/TRgEhIhdKWbYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:57:02.925125Z","bundle_sha256":"8116c28359e6315014a5c17049be1671bfa545490561e833b80f7b42fd475d59"}}