{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UN6VNH7P4BLDAOWZI4UP6OWXF5","short_pith_number":"pith:UN6VNH7P","schema_version":"1.0","canonical_sha256":"a37d569fefe056303ad94728ff3ad72f51140ae6b7bf6cc573abfa39c60b2bf7","source":{"kind":"arxiv","id":"2202.02467","version":3},"attestation_state":"computed","paper":{"title":"Group Testing with Correlation under Edge-Faulty Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hesam Nikpey, Jungyeol Kim, Saswati Sarkar, Shirin Saeedi Bidokhti, Xingran Chen","submitted_at":"2022-02-05T02:31:09Z","abstract_excerpt":"In applications of group testing in networks, e.g. identifying individuals who are infected by a disease spread over a network, exploiting correlation among network nodes provides fundamental opportunities in reducing the number of tests needed. We model and analyze group testing on $n$ correlated nodes whose interactions are specified by a graph $G$. We model correlation through an edge-faulty random graph formed from $G$ in which each edge is dropped with probability $1-r$, and all nodes in the same component have the same state. We consider three classes of graphs: cycles and trees, $d$-reg"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2202.02467","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-02-05T02:31:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"621bf12dca395ab6d696f2d918b6e418ee3d9c0639f7979b25ecfcc3b96b65b7","abstract_canon_sha256":"6bf815bc152cb52c23bbe22ea196857b619250911d19e63d93e399b300779a90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:52:18.544918Z","signature_b64":"qN4/jtLaBdwT4jLPJLMevzau4uw6u2kEPllKqVwmI/8V3w0ZA7CGdWGMK8gSUeWMv3NQG8BDPrHKWULfe+w1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a37d569fefe056303ad94728ff3ad72f51140ae6b7bf6cc573abfa39c60b2bf7","last_reissued_at":"2026-07-05T05:52:18.544437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:52:18.544437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Testing with Correlation under Edge-Faulty Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hesam Nikpey, Jungyeol Kim, Saswati Sarkar, Shirin Saeedi Bidokhti, Xingran Chen","submitted_at":"2022-02-05T02:31:09Z","abstract_excerpt":"In applications of group testing in networks, e.g. identifying individuals who are infected by a disease spread over a network, exploiting correlation among network nodes provides fundamental opportunities in reducing the number of tests needed. We model and analyze group testing on $n$ correlated nodes whose interactions are specified by a graph $G$. We model correlation through an edge-faulty random graph formed from $G$ in which each edge is dropped with probability $1-r$, and all nodes in the same component have the same state. We consider three classes of graphs: cycles and trees, $d$-reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02467","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.02467/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2202.02467","created_at":"2026-07-05T05:52:18.544495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.02467v3","created_at":"2026-07-05T05:52:18.544495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02467","created_at":"2026-07-05T05:52:18.544495+00:00"},{"alias_kind":"pith_short_12","alias_value":"UN6VNH7P4BLD","created_at":"2026-07-05T05:52:18.544495+00:00"},{"alias_kind":"pith_short_16","alias_value":"UN6VNH7P4BLDAOWZ","created_at":"2026-07-05T05:52:18.544495+00:00"},{"alias_kind":"pith_short_8","alias_value":"UN6VNH7P","created_at":"2026-07-05T05:52:18.544495+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17751","citing_title":"Group Testing with General Correlation Using Hypergraphs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5","json":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5.json","graph_json":"https://pith.science/api/pith-number/UN6VNH7P4BLDAOWZI4UP6OWXF5/graph.json","events_json":"https://pith.science/api/pith-number/UN6VNH7P4BLDAOWZI4UP6OWXF5/events.json","paper":"https://pith.science/paper/UN6VNH7P"},"agent_actions":{"view_html":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5","download_json":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5.json","view_paper":"https://pith.science/paper/UN6VNH7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.02467&json=true","fetch_graph":"https://pith.science/api/pith-number/UN6VNH7P4BLDAOWZI4UP6OWXF5/graph.json","fetch_events":"https://pith.science/api/pith-number/UN6VNH7P4BLDAOWZI4UP6OWXF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5/action/storage_attestation","attest_author":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5/action/author_attestation","sign_citation":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5/action/citation_signature","submit_replication":"https://pith.science/pith/UN6VNH7P4BLDAOWZI4UP6OWXF5/action/replication_record"}},"created_at":"2026-07-05T05:52:18.544495+00:00","updated_at":"2026-07-05T05:52:18.544495+00:00"}