{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VD32DP5JTI7RQEUM7KDGSBSGFE","short_pith_number":"pith:VD32DP5J","schema_version":"1.0","canonical_sha256":"a8f7a1bfa99a3f18128cfa86690646292607867cca5dbce3cab6036becbc53d0","source":{"kind":"arxiv","id":"1906.01031","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Existence Results for Parent-Identifying Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Grigory Kabatiansky, Minquan Cheng, Ying Miao, Yujie Gu","submitted_at":"2019-06-03T19:16:03Z","abstract_excerpt":"Parent-identifying schemes provide a way to identify causes from effects for some information systems such as digital fingerprinting and group testing. In this paper, we consider combinatorial structures for parent-identifying schemes. First, we establish an equivalent relationship between parent-identifying schemes and forbidden configurations. Based on this relationship, we derive probabilistic existence lower bounds for two related combinatorial structures, that is, $t$-parent-identifying set systems ($t$-IPPS) and $t$-multimedia parent-identifying codes ($t$-MIPPC), which are used in broad"},"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":"1906.01031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-03T19:16:03Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"57ed50e7ed514d6b613b6980df31ff503031c134f8686093e1e5125917fc0d18","abstract_canon_sha256":"15f9d0dbff1c68edafc26d85b2dba72337eb6ac039db6278fe2b142a401de17a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:18.059078Z","signature_b64":"1VC3mDqUaPvCr0vf1g63WeAC1mhGI7zTsNr5UbdPp0i2QxZ4CWhMBm6+oSe5i84KARtEz88CYOcUggkN4wNcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8f7a1bfa99a3f18128cfa86690646292607867cca5dbce3cab6036becbc53d0","last_reissued_at":"2026-05-17T23:44:18.058615Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:18.058615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Existence Results for Parent-Identifying Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Grigory Kabatiansky, Minquan Cheng, Ying Miao, Yujie Gu","submitted_at":"2019-06-03T19:16:03Z","abstract_excerpt":"Parent-identifying schemes provide a way to identify causes from effects for some information systems such as digital fingerprinting and group testing. In this paper, we consider combinatorial structures for parent-identifying schemes. First, we establish an equivalent relationship between parent-identifying schemes and forbidden configurations. Based on this relationship, we derive probabilistic existence lower bounds for two related combinatorial structures, that is, $t$-parent-identifying set systems ($t$-IPPS) and $t$-multimedia parent-identifying codes ($t$-MIPPC), which are used in broad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01031","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.01031","created_at":"2026-05-17T23:44:18.058683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01031v1","created_at":"2026-05-17T23:44:18.058683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01031","created_at":"2026-05-17T23:44:18.058683+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD32DP5JTI7R","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD32DP5JTI7RQEUM","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD32DP5J","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE","json":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE.json","graph_json":"https://pith.science/api/pith-number/VD32DP5JTI7RQEUM7KDGSBSGFE/graph.json","events_json":"https://pith.science/api/pith-number/VD32DP5JTI7RQEUM7KDGSBSGFE/events.json","paper":"https://pith.science/paper/VD32DP5J"},"agent_actions":{"view_html":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE","download_json":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE.json","view_paper":"https://pith.science/paper/VD32DP5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01031&json=true","fetch_graph":"https://pith.science/api/pith-number/VD32DP5JTI7RQEUM7KDGSBSGFE/graph.json","fetch_events":"https://pith.science/api/pith-number/VD32DP5JTI7RQEUM7KDGSBSGFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE/action/storage_attestation","attest_author":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE/action/author_attestation","sign_citation":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE/action/citation_signature","submit_replication":"https://pith.science/pith/VD32DP5JTI7RQEUM7KDGSBSGFE/action/replication_record"}},"created_at":"2026-05-17T23:44:18.058683+00:00","updated_at":"2026-05-17T23:44:18.058683+00:00"}