{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:73G4Y4AZKI6U3PRCGX2RK5SJC4","short_pith_number":"pith:73G4Y4AZ","canonical_record":{"source":{"id":"1509.06333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-21T18:44:53Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"0bacd4429ff24876e01b77cf8be3b4ac66cfc55a0f3e30eacd82c528794c84c8","abstract_canon_sha256":"4924707ee2c64d96fa45b91b82b091874f9c11db35ae580acbf140bae700ba88"},"schema_version":"1.0"},"canonical_sha256":"fecdcc7019523d4dbe2235f5157649173416ee4a2dae97c2b137f17b3f66eaa9","source":{"kind":"arxiv","id":"1509.06333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06333","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06333v1","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06333","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"73G4Y4AZKI6U","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"73G4Y4AZKI6U3PRC","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"73G4Y4AZ","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:73G4Y4AZKI6U3PRCGX2RK5SJC4","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-21T18:44:53Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"0bacd4429ff24876e01b77cf8be3b4ac66cfc55a0f3e30eacd82c528794c84c8","abstract_canon_sha256":"4924707ee2c64d96fa45b91b82b091874f9c11db35ae580acbf140bae700ba88"},"schema_version":"1.0"},"canonical_sha256":"fecdcc7019523d4dbe2235f5157649173416ee4a2dae97c2b137f17b3f66eaa9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:35.296837Z","signature_b64":"5Pm8I+jtWI+5cCVqcMKIzLq8eqgmukjYzXZV2uSJz0KtM4kSqW5T1UWSdKEvgNnFMdNrfvUsWmss5BdpLW6+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fecdcc7019523d4dbe2235f5157649173416ee4a2dae97c2b137f17b3f66eaa9","last_reissued_at":"2026-05-18T01:32:35.296293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:35.296293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06333","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-18T01:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UH9ly39JuMJ/T10zuOVHGnnb9EEhhJBygLoVXNVcL8kTR9gKEqrXgRRX9eNRPiSPy3m4px92uYzf2cl25b0JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T06:50:47.238937Z"},"content_sha256":"2a5210e239114e0c329749adf5ca5dba2756adbd404fe14d9f7702cb18ca7481","schema_version":"1.0","event_id":"sha256:2a5210e239114e0c329749adf5ca5dba2756adbd404fe14d9f7702cb18ca7481"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:73G4Y4AZKI6U3PRCGX2RK5SJC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Capability in Localizing Node Failures via End-to-end Path Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Ananthram Swami, Don Towsley, Kin K. Leung, Liang Ma, Ting He","submitted_at":"2015-09-21T18:44:53Z","abstract_excerpt":"We investigate the capability of localizing node failures in communication networks from binary states (normal/failed) of end-to-end paths. Given a set of nodes of interest, uniquely localizing failures within this set requires that different observable path states associate with different node failure events. However, this condition is difficult to test on large networks due to the need to enumerate all possible node failures. Our first contribution is a set of sufficient/necessary conditions for identifying a bounded number of failures within an arbitrary node set that can be tested in polyn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06333","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-18T01:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ksFx8l/vykuZe8V+vUXRDgIaj3/85CZYXuKS5uFeqXfPk/N/TfstWmoMC6JEcmIS5TLApNjNqDMu40E8/zCzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T06:50:47.239562Z"},"content_sha256":"06e6c25be60273d179291dfe22385c160b18aa5e0fc89fb6e97d554ca11083e1","schema_version":"1.0","event_id":"sha256:06e6c25be60273d179291dfe22385c160b18aa5e0fc89fb6e97d554ca11083e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73G4Y4AZKI6U3PRCGX2RK5SJC4/bundle.json","state_url":"https://pith.science/pith/73G4Y4AZKI6U3PRCGX2RK5SJC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73G4Y4AZKI6U3PRCGX2RK5SJC4/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-19T06:50:47Z","links":{"resolver":"https://pith.science/pith/73G4Y4AZKI6U3PRCGX2RK5SJC4","bundle":"https://pith.science/pith/73G4Y4AZKI6U3PRCGX2RK5SJC4/bundle.json","state":"https://pith.science/pith/73G4Y4AZKI6U3PRCGX2RK5SJC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73G4Y4AZKI6U3PRCGX2RK5SJC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:73G4Y4AZKI6U3PRCGX2RK5SJC4","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":"4924707ee2c64d96fa45b91b82b091874f9c11db35ae580acbf140bae700ba88","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-21T18:44:53Z","title_canon_sha256":"0bacd4429ff24876e01b77cf8be3b4ac66cfc55a0f3e30eacd82c528794c84c8"},"schema_version":"1.0","source":{"id":"1509.06333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06333","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06333v1","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06333","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"73G4Y4AZKI6U","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"73G4Y4AZKI6U3PRC","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"73G4Y4AZ","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:06e6c25be60273d179291dfe22385c160b18aa5e0fc89fb6e97d554ca11083e1","target":"graph","created_at":"2026-05-18T01:32:35Z","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 investigate the capability of localizing node failures in communication networks from binary states (normal/failed) of end-to-end paths. Given a set of nodes of interest, uniquely localizing failures within this set requires that different observable path states associate with different node failure events. However, this condition is difficult to test on large networks due to the need to enumerate all possible node failures. Our first contribution is a set of sufficient/necessary conditions for identifying a bounded number of failures within an arbitrary node set that can be tested in polyn","authors_text":"Ananthram Swami, Don Towsley, Kin K. Leung, Liang Ma, Ting He","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-21T18:44:53Z","title":"Network Capability in Localizing Node Failures via End-to-end Path Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06333","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:2a5210e239114e0c329749adf5ca5dba2756adbd404fe14d9f7702cb18ca7481","target":"record","created_at":"2026-05-18T01:32:35Z","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":"4924707ee2c64d96fa45b91b82b091874f9c11db35ae580acbf140bae700ba88","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-09-21T18:44:53Z","title_canon_sha256":"0bacd4429ff24876e01b77cf8be3b4ac66cfc55a0f3e30eacd82c528794c84c8"},"schema_version":"1.0","source":{"id":"1509.06333","kind":"arxiv","version":1}},"canonical_sha256":"fecdcc7019523d4dbe2235f5157649173416ee4a2dae97c2b137f17b3f66eaa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fecdcc7019523d4dbe2235f5157649173416ee4a2dae97c2b137f17b3f66eaa9","first_computed_at":"2026-05-18T01:32:35.296293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:35.296293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Pm8I+jtWI+5cCVqcMKIzLq8eqgmukjYzXZV2uSJz0KtM4kSqW5T1UWSdKEvgNnFMdNrfvUsWmss5BdpLW6+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:35.296837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a5210e239114e0c329749adf5ca5dba2756adbd404fe14d9f7702cb18ca7481","sha256:06e6c25be60273d179291dfe22385c160b18aa5e0fc89fb6e97d554ca11083e1"],"state_sha256":"6fec55392422b352f3e83a180623f57b61140eb67c63235ffdb1ec860c2332de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpBC8p3aT5s7E3C6oAZD4X6SRXaXEtq1pO2DI2jKn9qZSdRtYErNrNxCQL7Z4/sMHbUuK8D9rHWNNjWjtAWbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T06:50:47.242360Z","bundle_sha256":"0e4b84f52b786bc4bf0da2f11b36a684c12f27bb48d766e9fe38245a29d9244f"}}