{"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"}