{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4YGXE2WI2JUUNYV4YAPMMQDG66","short_pith_number":"pith:4YGXE2WI","schema_version":"1.0","canonical_sha256":"e60d726ac8d26946e2bcc01ec64066f7a537c22710cc9ef30108e8e2b2132fb9","source":{"kind":"arxiv","id":"2506.01747","version":1},"attestation_state":"computed","paper":{"title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Elsa Dupraz, Ismaila Salihou Adamou, Reza Asvadi, Tad Matsumoto","submitted_at":"2025-06-02T14:53:56Z","abstract_excerpt":"This paper addresses the design of practical shortlength coding schemes for Distributed Hypothesis Testing (DHT). While most prior work on DHT has focused on informationtheoretic analyses, deriving bounds on Type-II error exponents via achievability schemes based on quantization and quantizebinning, the practical implementation of DHT coding schemes has remained largely unexplored. Moreover, existing practical coding solutions for quantization and quantize-binning approaches were developed for source reconstruction tasks considering very long code length, and they are not directly applicable t"},"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":"2506.01747","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-02T14:53:56Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"9f9b5b139a6ebfc998303b3f702c2bce10e135a239cb288eeb52d425d1a33d74","abstract_canon_sha256":"64117077eabce49c8f403e351a4c1f11c57bea927029471a508e833ac043a2de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:18.885471Z","signature_b64":"zej8W0cdUhy/EcTwGvY+/LMggULkexVbKdnZU5Y0n9zY2q0cZOFccpJEanwKz4qpc9FwF4I1/dxK11+qolJ0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e60d726ac8d26946e2bcc01ec64066f7a537c22710cc9ef30108e8e2b2132fb9","last_reissued_at":"2026-07-05T11:14:18.884991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:18.884991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Elsa Dupraz, Ismaila Salihou Adamou, Reza Asvadi, Tad Matsumoto","submitted_at":"2025-06-02T14:53:56Z","abstract_excerpt":"This paper addresses the design of practical shortlength coding schemes for Distributed Hypothesis Testing (DHT). While most prior work on DHT has focused on informationtheoretic analyses, deriving bounds on Type-II error exponents via achievability schemes based on quantization and quantizebinning, the practical implementation of DHT coding schemes has remained largely unexplored. Moreover, existing practical coding solutions for quantization and quantize-binning approaches were developed for source reconstruction tasks considering very long code length, and they are not directly applicable t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01747","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01747/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":"2506.01747","created_at":"2026-07-05T11:14:18.885046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01747v1","created_at":"2026-07-05T11:14:18.885046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01747","created_at":"2026-07-05T11:14:18.885046+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YGXE2WI2JUU","created_at":"2026-07-05T11:14:18.885046+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YGXE2WI2JUUNYV4","created_at":"2026-07-05T11:14:18.885046+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YGXE2WI","created_at":"2026-07-05T11:14:18.885046+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/4YGXE2WI2JUUNYV4YAPMMQDG66","json":"https://pith.science/pith/4YGXE2WI2JUUNYV4YAPMMQDG66.json","graph_json":"https://pith.science/api/pith-number/4YGXE2WI2JUUNYV4YAPMMQDG66/graph.json","events_json":"https://pith.science/api/pith-number/4YGXE2WI2JUUNYV4YAPMMQDG66/events.json","paper":"https://pith.science/paper/4YGXE2WI"},"agent_actions":{"view_html":"https://pith.science/pith/4YGXE2WI2JUUNYV4YAPMMQDG66","download_json":"https://pith.science/pith/4YGXE2WI2JUUNYV4YAPMMQDG66.json","view_paper":"https://pith.science/paper/4YGXE2WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01747&json=true","fetch_graph":"https://pith.science/api/pith-number/4YGXE2WI2JUUNYV4YAPMMQDG66/graph.json","fetch_events":"https://pith.science/api/pith-number/4YGXE2WI2JUUNYV4YAPMMQDG66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YGXE2WI2JUUNYV4YAPMMQDG66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YGXE2WI2JUUNYV4YAPMMQDG66/action/storage_attestation","attest_author":"https://pith.science/pith/4YGXE2WI2JUUNYV4YAPMMQDG66/action/author_attestation","sign_citation":"https://pith.science/pith/4YGXE2WI2JUUNYV4YAPMMQDG66/action/citation_signature","submit_replication":"https://pith.science/pith/4YGXE2WI2JUUNYV4YAPMMQDG66/action/replication_record"}},"created_at":"2026-07-05T11:14:18.885046+00:00","updated_at":"2026-07-05T11:14:18.885046+00:00"}