{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HGVRAFSM2XQKTFHH3GVVUOL5GC","short_pith_number":"pith:HGVRAFSM","canonical_record":{"source":{"id":"1906.02929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-07T07:19:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c645c197cd1e8e949edd0f0173b7d4d0159b71beef33c12b4ccabfa6ea9efd54","abstract_canon_sha256":"63c83b561b3f73a1a015338e5245ea1c7ab9587cc22d158d1a14d3ce8a4b57e5"},"schema_version":"1.0"},"canonical_sha256":"39ab10164cd5e0a994e7d9ab5a397d30a4a05d53ae172a40d74bd3073da7924f","source":{"kind":"arxiv","id":"1906.02929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02929","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02929v1","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02929","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"pith_short_12","alias_value":"HGVRAFSM2XQK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGVRAFSM2XQKTFHH","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGVRAFSM","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HGVRAFSM2XQKTFHH3GVVUOL5GC","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-07T07:19:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c645c197cd1e8e949edd0f0173b7d4d0159b71beef33c12b4ccabfa6ea9efd54","abstract_canon_sha256":"63c83b561b3f73a1a015338e5245ea1c7ab9587cc22d158d1a14d3ce8a4b57e5"},"schema_version":"1.0"},"canonical_sha256":"39ab10164cd5e0a994e7d9ab5a397d30a4a05d53ae172a40d74bd3073da7924f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:55.648625Z","signature_b64":"jyAsl2lNLVVUwt6X4exIOFrJDj/lJhfiCUNDqxwopjU4boqVm5Fsob1Nb08SYu8HBqU/gQype6jGtwnefaLwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ab10164cd5e0a994e7d9ab5a397d30a4a05d53ae172a40d74bd3073da7924f","last_reissued_at":"2026-05-17T23:43:55.647795Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:55.647795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02929","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-17T23:43:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s53bUQ7Z0gdBRGj0HkbHrZjBUmrcfUQWSXGxLlhsKNJldlhHS2QwPFycyZHgkm+brn2OZdovpYfxZk0q8c8EDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T21:25:25.103788Z"},"content_sha256":"725a02b70181ac3ddb796fc1c1808383c21e1b6834ad01e71b24e058fc0b1483","schema_version":"1.0","event_id":"sha256:725a02b70181ac3ddb796fc1c1808383c21e1b6834ad01e71b24e058fc0b1483"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HGVRAFSM2XQKTFHH3GVVUOL5GC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding Theorems for Asynchronous Slepian-Wolf Coding Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tetsunao Matsuta, Tomohiko Uyematsu","submitted_at":"2019-06-07T07:19:24Z","abstract_excerpt":"The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode source sequences from two correlated sources into codewords, and the decoder reconstructs both source sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder samples a source sequence with some unknown delay. We assume that delays are unknown but maximum and minimum values of possible delays are known to encoders and the decoder. We also assume that sources are discrete stationar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02929","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-17T23:43:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2+DBSieZF9QJCxvb6cdPA43FUA/FXiZS9XW3DHUsvRv8I60jKq8cjHO3xWquMa9sR+rVr1i8mc5guYD+HzwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T21:25:25.104134Z"},"content_sha256":"3bcc7e881103cafda9a5b3eccf04a3a6318e0c3351bb0d8cc856eaeb1b061a05","schema_version":"1.0","event_id":"sha256:3bcc7e881103cafda9a5b3eccf04a3a6318e0c3351bb0d8cc856eaeb1b061a05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGVRAFSM2XQKTFHH3GVVUOL5GC/bundle.json","state_url":"https://pith.science/pith/HGVRAFSM2XQKTFHH3GVVUOL5GC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGVRAFSM2XQKTFHH3GVVUOL5GC/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-19T21:25:25Z","links":{"resolver":"https://pith.science/pith/HGVRAFSM2XQKTFHH3GVVUOL5GC","bundle":"https://pith.science/pith/HGVRAFSM2XQKTFHH3GVVUOL5GC/bundle.json","state":"https://pith.science/pith/HGVRAFSM2XQKTFHH3GVVUOL5GC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGVRAFSM2XQKTFHH3GVVUOL5GC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HGVRAFSM2XQKTFHH3GVVUOL5GC","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":"63c83b561b3f73a1a015338e5245ea1c7ab9587cc22d158d1a14d3ce8a4b57e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-07T07:19:24Z","title_canon_sha256":"c645c197cd1e8e949edd0f0173b7d4d0159b71beef33c12b4ccabfa6ea9efd54"},"schema_version":"1.0","source":{"id":"1906.02929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02929","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02929v1","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02929","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"pith_short_12","alias_value":"HGVRAFSM2XQK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGVRAFSM2XQKTFHH","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGVRAFSM","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:3bcc7e881103cafda9a5b3eccf04a3a6318e0c3351bb0d8cc856eaeb1b061a05","target":"graph","created_at":"2026-05-17T23:43:55Z","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":"The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode source sequences from two correlated sources into codewords, and the decoder reconstructs both source sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder samples a source sequence with some unknown delay. We assume that delays are unknown but maximum and minimum values of possible delays are known to encoders and the decoder. We also assume that sources are discrete stationar","authors_text":"Tetsunao Matsuta, Tomohiko Uyematsu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-07T07:19:24Z","title":"Coding Theorems for Asynchronous Slepian-Wolf Coding Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02929","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:725a02b70181ac3ddb796fc1c1808383c21e1b6834ad01e71b24e058fc0b1483","target":"record","created_at":"2026-05-17T23:43:55Z","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":"63c83b561b3f73a1a015338e5245ea1c7ab9587cc22d158d1a14d3ce8a4b57e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-07T07:19:24Z","title_canon_sha256":"c645c197cd1e8e949edd0f0173b7d4d0159b71beef33c12b4ccabfa6ea9efd54"},"schema_version":"1.0","source":{"id":"1906.02929","kind":"arxiv","version":1}},"canonical_sha256":"39ab10164cd5e0a994e7d9ab5a397d30a4a05d53ae172a40d74bd3073da7924f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39ab10164cd5e0a994e7d9ab5a397d30a4a05d53ae172a40d74bd3073da7924f","first_computed_at":"2026-05-17T23:43:55.647795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:55.647795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jyAsl2lNLVVUwt6X4exIOFrJDj/lJhfiCUNDqxwopjU4boqVm5Fsob1Nb08SYu8HBqU/gQype6jGtwnefaLwAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:55.648625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:725a02b70181ac3ddb796fc1c1808383c21e1b6834ad01e71b24e058fc0b1483","sha256:3bcc7e881103cafda9a5b3eccf04a3a6318e0c3351bb0d8cc856eaeb1b061a05"],"state_sha256":"9c285ab80bc7b8dceb51b9a645b5de30e2c23ed5e5fcc2de82c86d8119a3279a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WWJT3VeTzjOezPj+rzkLPPHASYZb6wqDV/GlOhSfsFPXh7rEO/J41O0wT6q8IBJg7XIaBLMgi5M7Ayxy1ZY9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T21:25:25.106029Z","bundle_sha256":"a523dd64fa0771adac499c78c270d1a45e370cb94a08379695f4bf742e55773c"}}