{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KQ6HJMET6WMW7CADNZREMOVZRX","short_pith_number":"pith:KQ6HJMET","canonical_record":{"source":{"id":"1812.01637","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-04T19:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"ed04eca61995727f42479ec071994b151ff0e98b78eba6af971fd944df1407a3","abstract_canon_sha256":"dbac35e00de7d749b061dfa0623f1a91569d5fecd6059e63aea3fa1923812f28"},"schema_version":"1.0"},"canonical_sha256":"543c74b093f5996f88036e62463ab98dd785ec9d84b3348e98bc971b3477c2f2","source":{"kind":"arxiv","id":"1812.01637","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01637","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01637v4","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01637","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"KQ6HJMET6WMW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KQ6HJMET6WMW7CAD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KQ6HJMET","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KQ6HJMET6WMW7CADNZREMOVZRX","target":"record","payload":{"canonical_record":{"source":{"id":"1812.01637","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-04T19:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"ed04eca61995727f42479ec071994b151ff0e98b78eba6af971fd944df1407a3","abstract_canon_sha256":"dbac35e00de7d749b061dfa0623f1a91569d5fecd6059e63aea3fa1923812f28"},"schema_version":"1.0"},"canonical_sha256":"543c74b093f5996f88036e62463ab98dd785ec9d84b3348e98bc971b3477c2f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:36.771109Z","signature_b64":"gWufJYNDQgg0RmjCWmn3f7fU6mMPbObiVcE15sAIncZduNZD/lryI1X4buIYWU8IJTKHXGNYB65SGSjN7LZcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"543c74b093f5996f88036e62463ab98dd785ec9d84b3348e98bc971b3477c2f2","last_reissued_at":"2026-05-17T23:41:36.769875Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:36.769875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.01637","source_version":4,"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:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F2d9nikwomXU1rHmpab+4LW7NqqdbPTU0NdoygcRTuXEmiQG4r+cU1ECs9Xl+lExUWk0mYPZMm0b2fC3IO5lDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:45:35.494515Z"},"content_sha256":"a5d597a8c9156680e10a7ae134eb92a381f08eb062cdcc369c62c7a6fb979a87","schema_version":"1.0","event_id":"sha256:a5d597a8c9156680e10a7ae134eb92a381f08eb062cdcc369c62c7a6fb979a87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KQ6HJMET6WMW7CADNZREMOVZRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fariba Ranjbar, Michele Zito, Nicola Galesi","submitted_at":"2018-12-04T19:23:28Z","abstract_excerpt":"In this paper we study the node failure identification problem in undirected graphs by means of Boolean Network Tomography. We argue that vertex connectivity plays a central role. We show tight bounds on the maximal identifiability in a particular class of graphs, the Line of Sight networks. We prove slightly weaker bounds on arbitrary networks. Finally we initiate the study of maximal identifiability in random networks. We focus on two models: the classical Erd\\H{o}s-R\\'enyi model, and that of Random Regular graphs. The framework proposed in the paper allows a probabilistic analysis of the id"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01637","kind":"arxiv","version":4},"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:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELi7EgfytBVh3YKXCi2KQJ3uw8hkdvHVX1DJmAp8X5cvyXcCIdQGoH+LMiyqZgt73oYLgFYe/baPLRqwewlwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:45:35.494854Z"},"content_sha256":"7d0d83beea82a8acc3d0ac8220a440a68ba5094ac2f05b70519adec22fd8090a","schema_version":"1.0","event_id":"sha256:7d0d83beea82a8acc3d0ac8220a440a68ba5094ac2f05b70519adec22fd8090a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQ6HJMET6WMW7CADNZREMOVZRX/bundle.json","state_url":"https://pith.science/pith/KQ6HJMET6WMW7CADNZREMOVZRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQ6HJMET6WMW7CADNZREMOVZRX/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-06-03T18:45:35Z","links":{"resolver":"https://pith.science/pith/KQ6HJMET6WMW7CADNZREMOVZRX","bundle":"https://pith.science/pith/KQ6HJMET6WMW7CADNZREMOVZRX/bundle.json","state":"https://pith.science/pith/KQ6HJMET6WMW7CADNZREMOVZRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQ6HJMET6WMW7CADNZREMOVZRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KQ6HJMET6WMW7CADNZREMOVZRX","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":"dbac35e00de7d749b061dfa0623f1a91569d5fecd6059e63aea3fa1923812f28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-04T19:23:28Z","title_canon_sha256":"ed04eca61995727f42479ec071994b151ff0e98b78eba6af971fd944df1407a3"},"schema_version":"1.0","source":{"id":"1812.01637","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01637","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01637v4","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01637","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"KQ6HJMET6WMW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KQ6HJMET6WMW7CAD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KQ6HJMET","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:7d0d83beea82a8acc3d0ac8220a440a68ba5094ac2f05b70519adec22fd8090a","target":"graph","created_at":"2026-05-17T23:41:36Z","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":"In this paper we study the node failure identification problem in undirected graphs by means of Boolean Network Tomography. We argue that vertex connectivity plays a central role. We show tight bounds on the maximal identifiability in a particular class of graphs, the Line of Sight networks. We prove slightly weaker bounds on arbitrary networks. Finally we initiate the study of maximal identifiability in random networks. We focus on two models: the classical Erd\\H{o}s-R\\'enyi model, and that of Random Regular graphs. The framework proposed in the paper allows a probabilistic analysis of the id","authors_text":"Fariba Ranjbar, Michele Zito, Nicola Galesi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-04T19:23:28Z","title":"Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01637","kind":"arxiv","version":4},"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:a5d597a8c9156680e10a7ae134eb92a381f08eb062cdcc369c62c7a6fb979a87","target":"record","created_at":"2026-05-17T23:41:36Z","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":"dbac35e00de7d749b061dfa0623f1a91569d5fecd6059e63aea3fa1923812f28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-04T19:23:28Z","title_canon_sha256":"ed04eca61995727f42479ec071994b151ff0e98b78eba6af971fd944df1407a3"},"schema_version":"1.0","source":{"id":"1812.01637","kind":"arxiv","version":4}},"canonical_sha256":"543c74b093f5996f88036e62463ab98dd785ec9d84b3348e98bc971b3477c2f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"543c74b093f5996f88036e62463ab98dd785ec9d84b3348e98bc971b3477c2f2","first_computed_at":"2026-05-17T23:41:36.769875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:36.769875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gWufJYNDQgg0RmjCWmn3f7fU6mMPbObiVcE15sAIncZduNZD/lryI1X4buIYWU8IJTKHXGNYB65SGSjN7LZcBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:36.771109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01637","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5d597a8c9156680e10a7ae134eb92a381f08eb062cdcc369c62c7a6fb979a87","sha256:7d0d83beea82a8acc3d0ac8220a440a68ba5094ac2f05b70519adec22fd8090a"],"state_sha256":"e8f7eb9a17051c84d1cc68b7b338a464682f79793b928b80622e8d673ff5cacf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2rv4SImvUZQs1TMZna4ECHvMrPL/OXEfD/Gwi/+kgrvHsZDpkV1hQZRKR/3uRe15F+r8+5/XrKRdqTWNQKEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:45:35.497539Z","bundle_sha256":"90b983bb10a9d409684c22d3d300a0216913f099a4b98bc5b3073c7c8147c5ef"}}