{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UFCQZALL6ELK2L4V7PXJ7HCZY7","short_pith_number":"pith:UFCQZALL","canonical_record":{"source":{"id":"1106.0941","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-06-06T00:09:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1e3368ecc351bc22a6c7f8a7ba41b4775b4983e5a2d4ba4720d95b64ee2c79e2","abstract_canon_sha256":"01733c0de604cf17a9b640f949e59a025ce2dac88617275dee42222334f1e891"},"schema_version":"1.0"},"canonical_sha256":"a1450c816bf116ad2f95fbee9f9c59c7f9b690db0cdd1f5288150e396833280d","source":{"kind":"arxiv","id":"1106.0941","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0941","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0941v3","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0941","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"UFCQZALL6ELK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UFCQZALL6ELK2L4V","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UFCQZALL","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UFCQZALL6ELK2L4V7PXJ7HCZY7","target":"record","payload":{"canonical_record":{"source":{"id":"1106.0941","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-06-06T00:09:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1e3368ecc351bc22a6c7f8a7ba41b4775b4983e5a2d4ba4720d95b64ee2c79e2","abstract_canon_sha256":"01733c0de604cf17a9b640f949e59a025ce2dac88617275dee42222334f1e891"},"schema_version":"1.0"},"canonical_sha256":"a1450c816bf116ad2f95fbee9f9c59c7f9b690db0cdd1f5288150e396833280d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.440027Z","signature_b64":"DouhlIMIFAhf7Z7f1RS5e2RN+0XqSKLCwjDCAfupxSnIw+fNILIfxSZqBcJRJd5U+N6JpXr59Jh7HLqQr2iiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1450c816bf116ad2f95fbee9f9c59c7f9b690db0cdd1f5288150e396833280d","last_reissued_at":"2026-05-18T00:58:43.439374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.439374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.0941","source_version":3,"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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05Mv35qo/rpsVuTkl10bgSUSXMRU3dzpYgVGTj2k3SIZh1yAR00a+f+SoRIJuKUGAw59naV1XyjS4cnXTktRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:15:32.173850Z"},"content_sha256":"3ae0deaf5b9dd1c8f4adad39b3c10aeadf2b9078a1810538f704d0b4f66e3110","schema_version":"1.0","event_id":"sha256:3ae0deaf5b9dd1c8f4adad39b3c10aeadf2b9078a1810538f704d0b4f66e3110"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UFCQZALL6ELK2L4V7PXJ7HCZY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Link Delay Estimation via Expander Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Mohammad H. Firooz, Sumit Roy","submitted_at":"2011-06-06T00:09:58Z","abstract_excerpt":"One of the purposes of network tomography is to infer the status of parameters (e.g., delay) for the links inside a network through end-to-end probing between (external) boundary nodes along predetermined routes. In this work, we apply concepts from compressed sensing and expander graphs to the delay estimation problem. We first show that a relative majority of network topologies are not expanders for existing expansion criteria. Motivated by this challenge, we then relax such criteria, enabling us to acquire simulation evidence that link delays can be estimated for 30% more networks. That is,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0941","kind":"arxiv","version":3},"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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uT0lKnrc4nWd5uL8fVVOj1BQLQcCG+YbYRYspRp2Rt+LLN1/OzUhhkYT4UDItaN6Hbd4i4Mb+FqFZmsXXigPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:15:32.174199Z"},"content_sha256":"790798f989876ef5efb39e824b0d24e839a3f59b0a8c86c50ecd93afbcb7c10f","schema_version":"1.0","event_id":"sha256:790798f989876ef5efb39e824b0d24e839a3f59b0a8c86c50ecd93afbcb7c10f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFCQZALL6ELK2L4V7PXJ7HCZY7/bundle.json","state_url":"https://pith.science/pith/UFCQZALL6ELK2L4V7PXJ7HCZY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFCQZALL6ELK2L4V7PXJ7HCZY7/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-28T14:15:32Z","links":{"resolver":"https://pith.science/pith/UFCQZALL6ELK2L4V7PXJ7HCZY7","bundle":"https://pith.science/pith/UFCQZALL6ELK2L4V7PXJ7HCZY7/bundle.json","state":"https://pith.science/pith/UFCQZALL6ELK2L4V7PXJ7HCZY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFCQZALL6ELK2L4V7PXJ7HCZY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UFCQZALL6ELK2L4V7PXJ7HCZY7","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":"01733c0de604cf17a9b640f949e59a025ce2dac88617275dee42222334f1e891","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-06-06T00:09:58Z","title_canon_sha256":"1e3368ecc351bc22a6c7f8a7ba41b4775b4983e5a2d4ba4720d95b64ee2c79e2"},"schema_version":"1.0","source":{"id":"1106.0941","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0941","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0941v3","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0941","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"UFCQZALL6ELK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UFCQZALL6ELK2L4V","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UFCQZALL","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:790798f989876ef5efb39e824b0d24e839a3f59b0a8c86c50ecd93afbcb7c10f","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"One of the purposes of network tomography is to infer the status of parameters (e.g., delay) for the links inside a network through end-to-end probing between (external) boundary nodes along predetermined routes. In this work, we apply concepts from compressed sensing and expander graphs to the delay estimation problem. We first show that a relative majority of network topologies are not expanders for existing expansion criteria. Motivated by this challenge, we then relax such criteria, enabling us to acquire simulation evidence that link delays can be estimated for 30% more networks. That is,","authors_text":"Mohammad H. Firooz, Sumit Roy","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-06-06T00:09:58Z","title":"Link Delay Estimation via Expander Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0941","kind":"arxiv","version":3},"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:3ae0deaf5b9dd1c8f4adad39b3c10aeadf2b9078a1810538f704d0b4f66e3110","target":"record","created_at":"2026-05-18T00:58:43Z","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":"01733c0de604cf17a9b640f949e59a025ce2dac88617275dee42222334f1e891","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-06-06T00:09:58Z","title_canon_sha256":"1e3368ecc351bc22a6c7f8a7ba41b4775b4983e5a2d4ba4720d95b64ee2c79e2"},"schema_version":"1.0","source":{"id":"1106.0941","kind":"arxiv","version":3}},"canonical_sha256":"a1450c816bf116ad2f95fbee9f9c59c7f9b690db0cdd1f5288150e396833280d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1450c816bf116ad2f95fbee9f9c59c7f9b690db0cdd1f5288150e396833280d","first_computed_at":"2026-05-18T00:58:43.439374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.439374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DouhlIMIFAhf7Z7f1RS5e2RN+0XqSKLCwjDCAfupxSnIw+fNILIfxSZqBcJRJd5U+N6JpXr59Jh7HLqQr2iiCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.440027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0941","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae0deaf5b9dd1c8f4adad39b3c10aeadf2b9078a1810538f704d0b4f66e3110","sha256:790798f989876ef5efb39e824b0d24e839a3f59b0a8c86c50ecd93afbcb7c10f"],"state_sha256":"3d75d15146d176050a4a08280e901562b86d2a8e4eb31469525dd5093e164472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNEhPI0vKAvMxB1VqANFmbsA0ZHDpDVdL8YFHjYxnE+TvGahGGuZ95gumzXo5ruRqfklHjrnYKBW0ADDGyPZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:15:32.176253Z","bundle_sha256":"68d540ee36583289ee4f08edcfa15e20298c6f30ea93014a2a6b08e43752d848"}}