{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SLC5U7B64SUIWCV5AB5O2JIIGQ","short_pith_number":"pith:SLC5U7B6","canonical_record":{"source":{"id":"1809.03589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T20:47:54Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"bb7d89f8faf45b697ad2f2caca1ccb6c0d9cacf89ce05c60ac3205cbfe491b02","abstract_canon_sha256":"35d0c29c514fa21b5cef12739a5fd048fd01febeccee82c08ff471f6068fbd39"},"schema_version":"1.0"},"canonical_sha256":"92c5da7c3ee4a88b0abd007aed25083410f92525bb245f5a7581fef06b74b9aa","source":{"kind":"arxiv","id":"1809.03589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03589","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03589v1","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03589","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"SLC5U7B64SUI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SLC5U7B64SUIWCV5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SLC5U7B6","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SLC5U7B64SUIWCV5AB5O2JIIGQ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T20:47:54Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"bb7d89f8faf45b697ad2f2caca1ccb6c0d9cacf89ce05c60ac3205cbfe491b02","abstract_canon_sha256":"35d0c29c514fa21b5cef12739a5fd048fd01febeccee82c08ff471f6068fbd39"},"schema_version":"1.0"},"canonical_sha256":"92c5da7c3ee4a88b0abd007aed25083410f92525bb245f5a7581fef06b74b9aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:00.376426Z","signature_b64":"ZLKsedGaeo26hfbdD5biIs20LOHwBuEiX4SwbnF/POYqcolxg8fgdQTuHm3KFIuxjGXsjSooxgBYCS54SZwOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92c5da7c3ee4a88b0abd007aed25083410f92525bb245f5a7581fef06b74b9aa","last_reissued_at":"2026-05-18T00:06:00.375774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:00.375774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03589","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-18T00:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AHZjKNv4admN2LaCmnlPmSLjJk7kDS980G9bZGc/CTpNko0VTfsu95/ZMGgE+UYilde5sU8vM5b5iG/YRk+9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:17:03.516707Z"},"content_sha256":"82043fc2a06373ce2ed5756940020a3c5299b743aac9b51beab0f02b62ea4e8d","schema_version":"1.0","event_id":"sha256:82043fc2a06373ce2ed5756940020a3c5299b743aac9b51beab0f02b62ea4e8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SLC5U7B64SUIWCV5AB5O2JIIGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unconstraining graph-constrained group testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Bruce Spang, Mary Wootters","submitted_at":"2018-09-10T20:47:54Z","abstract_excerpt":"In network tomography, one goal is to identify a small set of failed links in a network, by sending a few packets through the network and seeing which reach their destination. This problem can be seen as a variant of combinatorial group testing, which has been studied before under the moniker \"graph-constrained group testing.\"\n  The main contribution of this work is to show that for most graphs, the \"constraints\" imposed by the underlying network topology are no constraint at all. That is, the number of tests required to identify the failed links in \"graph-constrained\" group testing is near-op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03589","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-18T00:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvYDEIxonHbpuEXZoiEdtuD7hPFT34G2gednHmxtWmsXbPjrSUOCyapRKkJT3XmZFEbsnLGobKw0AbI2reyuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:17:03.517055Z"},"content_sha256":"37adaa980fc6ef8c8991adba60afc39dfa0ecbd98d048eaf32d157e2deca01f7","schema_version":"1.0","event_id":"sha256:37adaa980fc6ef8c8991adba60afc39dfa0ecbd98d048eaf32d157e2deca01f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLC5U7B64SUIWCV5AB5O2JIIGQ/bundle.json","state_url":"https://pith.science/pith/SLC5U7B64SUIWCV5AB5O2JIIGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLC5U7B64SUIWCV5AB5O2JIIGQ/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-07T12:17:03Z","links":{"resolver":"https://pith.science/pith/SLC5U7B64SUIWCV5AB5O2JIIGQ","bundle":"https://pith.science/pith/SLC5U7B64SUIWCV5AB5O2JIIGQ/bundle.json","state":"https://pith.science/pith/SLC5U7B64SUIWCV5AB5O2JIIGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLC5U7B64SUIWCV5AB5O2JIIGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SLC5U7B64SUIWCV5AB5O2JIIGQ","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":"35d0c29c514fa21b5cef12739a5fd048fd01febeccee82c08ff471f6068fbd39","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T20:47:54Z","title_canon_sha256":"bb7d89f8faf45b697ad2f2caca1ccb6c0d9cacf89ce05c60ac3205cbfe491b02"},"schema_version":"1.0","source":{"id":"1809.03589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03589","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03589v1","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03589","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"SLC5U7B64SUI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SLC5U7B64SUIWCV5","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SLC5U7B6","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:37adaa980fc6ef8c8991adba60afc39dfa0ecbd98d048eaf32d157e2deca01f7","target":"graph","created_at":"2026-05-18T00:06:00Z","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 network tomography, one goal is to identify a small set of failed links in a network, by sending a few packets through the network and seeing which reach their destination. This problem can be seen as a variant of combinatorial group testing, which has been studied before under the moniker \"graph-constrained group testing.\"\n  The main contribution of this work is to show that for most graphs, the \"constraints\" imposed by the underlying network topology are no constraint at all. That is, the number of tests required to identify the failed links in \"graph-constrained\" group testing is near-op","authors_text":"Bruce Spang, Mary Wootters","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T20:47:54Z","title":"Unconstraining graph-constrained group testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03589","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:82043fc2a06373ce2ed5756940020a3c5299b743aac9b51beab0f02b62ea4e8d","target":"record","created_at":"2026-05-18T00:06:00Z","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":"35d0c29c514fa21b5cef12739a5fd048fd01febeccee82c08ff471f6068fbd39","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T20:47:54Z","title_canon_sha256":"bb7d89f8faf45b697ad2f2caca1ccb6c0d9cacf89ce05c60ac3205cbfe491b02"},"schema_version":"1.0","source":{"id":"1809.03589","kind":"arxiv","version":1}},"canonical_sha256":"92c5da7c3ee4a88b0abd007aed25083410f92525bb245f5a7581fef06b74b9aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92c5da7c3ee4a88b0abd007aed25083410f92525bb245f5a7581fef06b74b9aa","first_computed_at":"2026-05-18T00:06:00.375774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:00.375774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLKsedGaeo26hfbdD5biIs20LOHwBuEiX4SwbnF/POYqcolxg8fgdQTuHm3KFIuxjGXsjSooxgBYCS54SZwOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:00.376426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82043fc2a06373ce2ed5756940020a3c5299b743aac9b51beab0f02b62ea4e8d","sha256:37adaa980fc6ef8c8991adba60afc39dfa0ecbd98d048eaf32d157e2deca01f7"],"state_sha256":"0802ee0d9faba580efe4d2d597ca97f1cecc0ad7c7eb759586615abbcb92218d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/DyjucSc+e0g3ov9rUWx4sMQmKAnip2sHW+fSDRRgpsKJfHhgLL8kL4PmuWuB1o8lznf8HwNizL+JfSEkeyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:17:03.519121Z","bundle_sha256":"cdb119bfefb2841f432606945fdc898fdd0de0af7afb7b258034d60c8e3b8a5a"}}