{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q5EU7R5YFYYZDJ2ZN3N6MTG63U","short_pith_number":"pith:Q5EU7R5Y","canonical_record":{"source":{"id":"1903.10636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-26T00:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"c164aa587664f9059fb2eb608d507b0e04e7a7dbdc935d5ba822c4c5cf18f4f2","abstract_canon_sha256":"d3c99188db3f7feee735e7c5c2fe54b30659f3efa101243112ccfeb71dd3f1b9"},"schema_version":"1.0"},"canonical_sha256":"87494fc7b82e3191a7596edbe64cdedd1dce60d5eb4f550e01b8aeb5cf2a247e","source":{"kind":"arxiv","id":"1903.10636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10636","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10636v1","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10636","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"Q5EU7R5YFYYZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q5EU7R5YFYYZDJ2Z","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q5EU7R5Y","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q5EU7R5YFYYZDJ2ZN3N6MTG63U","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-26T00:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"c164aa587664f9059fb2eb608d507b0e04e7a7dbdc935d5ba822c4c5cf18f4f2","abstract_canon_sha256":"d3c99188db3f7feee735e7c5c2fe54b30659f3efa101243112ccfeb71dd3f1b9"},"schema_version":"1.0"},"canonical_sha256":"87494fc7b82e3191a7596edbe64cdedd1dce60d5eb4f550e01b8aeb5cf2a247e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:18.260959Z","signature_b64":"6Bjn311zR78M9Ysg5tzXMSuxMfs1QacW22ZOb4UFw6QObvHENgTxqYMpR6X9z54UkCPumLtZCO9o3VMtpw4JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87494fc7b82e3191a7596edbe64cdedd1dce60d5eb4f550e01b8aeb5cf2a247e","last_reissued_at":"2026-05-17T23:50:18.260335Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:18.260335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10636","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:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ugcRlM0V4LHcNYNzZTs4AyGdIi0AtG2j8oCnXTDGvsbVzBkSqnH8xCCb3fz6rmNONYQ2BWAdUQEDDWHOXaBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:36:39.404459Z"},"content_sha256":"d00b966898b4574c41f70e1b9b4d280121aebdb76272e5e97789ab1697ef44d2","schema_version":"1.0","event_id":"sha256:d00b966898b4574c41f70e1b9b4d280121aebdb76272e5e97789ab1697ef44d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q5EU7R5YFYYZDJ2ZN3N6MTG63U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Fundamental Bounds of Failure Identifiability by Boolean Network Tomography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Annalisa Massini, Hana Khamfroush, Novella Bartolini, Ting He, Viviana Arrigoni","submitted_at":"2019-03-26T00:03:10Z","abstract_excerpt":"Boolean network tomography is a powerful tool to infer the state (working/failed) of individual nodes from path-level measurements obtained by egde-nodes. We consider the problem of optimizing the capability of identifying network failures through the design of monitoring schemes. Finding an optimal solution is NP-hard and a large body of work has been devoted to heuristic approaches providing lower bounds. Unlike previous works, we provide upper bounds on the maximum number of identifiable nodes, given the number of monitoring paths and different constraints on the network topology, the routi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10636","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:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhMJXicS6uVZnf80gmpuvDNtvoUwjTbZnJlb87y9E8XdE2d/tQPQxFTU3QnVYaUfohOKle/ps6YTaG01pkXiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:36:39.404880Z"},"content_sha256":"66373c6a7959865635cf7def3f7b346b3102e9a5b509e781fcff9bb6641ecfe4","schema_version":"1.0","event_id":"sha256:66373c6a7959865635cf7def3f7b346b3102e9a5b509e781fcff9bb6641ecfe4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5EU7R5YFYYZDJ2ZN3N6MTG63U/bundle.json","state_url":"https://pith.science/pith/Q5EU7R5YFYYZDJ2ZN3N6MTG63U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5EU7R5YFYYZDJ2ZN3N6MTG63U/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-24T17:36:39Z","links":{"resolver":"https://pith.science/pith/Q5EU7R5YFYYZDJ2ZN3N6MTG63U","bundle":"https://pith.science/pith/Q5EU7R5YFYYZDJ2ZN3N6MTG63U/bundle.json","state":"https://pith.science/pith/Q5EU7R5YFYYZDJ2ZN3N6MTG63U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5EU7R5YFYYZDJ2ZN3N6MTG63U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q5EU7R5YFYYZDJ2ZN3N6MTG63U","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":"d3c99188db3f7feee735e7c5c2fe54b30659f3efa101243112ccfeb71dd3f1b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-26T00:03:10Z","title_canon_sha256":"c164aa587664f9059fb2eb608d507b0e04e7a7dbdc935d5ba822c4c5cf18f4f2"},"schema_version":"1.0","source":{"id":"1903.10636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10636","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10636v1","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10636","created_at":"2026-05-17T23:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"Q5EU7R5YFYYZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q5EU7R5YFYYZDJ2Z","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q5EU7R5Y","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:66373c6a7959865635cf7def3f7b346b3102e9a5b509e781fcff9bb6641ecfe4","target":"graph","created_at":"2026-05-17T23:50:18Z","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":"Boolean network tomography is a powerful tool to infer the state (working/failed) of individual nodes from path-level measurements obtained by egde-nodes. We consider the problem of optimizing the capability of identifying network failures through the design of monitoring schemes. Finding an optimal solution is NP-hard and a large body of work has been devoted to heuristic approaches providing lower bounds. Unlike previous works, we provide upper bounds on the maximum number of identifiable nodes, given the number of monitoring paths and different constraints on the network topology, the routi","authors_text":"Annalisa Massini, Hana Khamfroush, Novella Bartolini, Ting He, Viviana Arrigoni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-26T00:03:10Z","title":"On Fundamental Bounds of Failure Identifiability by Boolean Network Tomography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10636","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:d00b966898b4574c41f70e1b9b4d280121aebdb76272e5e97789ab1697ef44d2","target":"record","created_at":"2026-05-17T23:50:18Z","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":"d3c99188db3f7feee735e7c5c2fe54b30659f3efa101243112ccfeb71dd3f1b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-26T00:03:10Z","title_canon_sha256":"c164aa587664f9059fb2eb608d507b0e04e7a7dbdc935d5ba822c4c5cf18f4f2"},"schema_version":"1.0","source":{"id":"1903.10636","kind":"arxiv","version":1}},"canonical_sha256":"87494fc7b82e3191a7596edbe64cdedd1dce60d5eb4f550e01b8aeb5cf2a247e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87494fc7b82e3191a7596edbe64cdedd1dce60d5eb4f550e01b8aeb5cf2a247e","first_computed_at":"2026-05-17T23:50:18.260335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:18.260335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Bjn311zR78M9Ysg5tzXMSuxMfs1QacW22ZOb4UFw6QObvHENgTxqYMpR6X9z54UkCPumLtZCO9o3VMtpw4JAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:18.260959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d00b966898b4574c41f70e1b9b4d280121aebdb76272e5e97789ab1697ef44d2","sha256:66373c6a7959865635cf7def3f7b346b3102e9a5b509e781fcff9bb6641ecfe4"],"state_sha256":"386798a03dece5262f2f9b094f660b35ddeab905aa42fd88859fea75618cca86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQcnBehULc3gGjwzi4LJseHXnqSr84gKBVNjzrEBkHm0tHUeVn255z7aOAmpVrkdmEV/troL8qFf174SvqA7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:36:39.407099Z","bundle_sha256":"f9a28a8432b0e108a838a4b5feadb046e97cbe68ca3d150c70e14bfd78faaa56"}}