{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:2QGHWSWJFJ2FUWSYAWWE6HRNGR","short_pith_number":"pith:2QGHWSWJ","canonical_record":{"source":{"id":"0906.1599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-08T21:39:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04c9730c5e550b29f66bf1a56aa1f6b3a32ccdb641e22cd0b762f0d7c572cb2c","abstract_canon_sha256":"21ed9de394fbb28ac3bc82d9b80fb7a5e7dd4194de41717d408d2875e60d2350"},"schema_version":"1.0"},"canonical_sha256":"d40c7b4ac92a745a5a5805ac4f1e2d3478965e27ef3df3ffab16c6c16d32b8c8","source":{"kind":"arxiv","id":"0906.1599","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.1599","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0906.1599v3","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.1599","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"2QGHWSWJFJ2F","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2QGHWSWJFJ2FUWSY","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2QGHWSWJ","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:2QGHWSWJFJ2FUWSYAWWE6HRNGR","target":"record","payload":{"canonical_record":{"source":{"id":"0906.1599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-08T21:39:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04c9730c5e550b29f66bf1a56aa1f6b3a32ccdb641e22cd0b762f0d7c572cb2c","abstract_canon_sha256":"21ed9de394fbb28ac3bc82d9b80fb7a5e7dd4194de41717d408d2875e60d2350"},"schema_version":"1.0"},"canonical_sha256":"d40c7b4ac92a745a5a5805ac4f1e2d3478965e27ef3df3ffab16c6c16d32b8c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.065125Z","signature_b64":"JUrobPtf0LE+HYoEscaEls5pxToNi8AtVIb0rsuBvdUOESLVCpHD19W/aCdPyhqFtwDM0BLrfHAhhZhHCJ+cCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d40c7b4ac92a745a5a5805ac4f1e2d3478965e27ef3df3ffab16c6c16d32b8c8","last_reissued_at":"2026-05-18T00:58:48.064630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.064630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.1599","source_version":3,"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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtZ5m0BAWfF2A6GeBUpg6A3/9I9mi3524PKmfbng4ky8BhaKs6DfltEpZbU9lCbj0pygDccrmrMNmYprS3JRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:30:32.715481Z"},"content_sha256":"6036ac6f61c10db4e98f840610bdb433e33a35347a6cfb55adddf68d42cfefcf","schema_version":"1.0","event_id":"sha256:6036ac6f61c10db4e98f840610bdb433e33a35347a6cfb55adddf68d42cfefcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:2QGHWSWJFJ2FUWSYAWWE6HRNGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bits Through Deterministic Relay Cascades with Half-Duplex Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Hausl, Ralf K\\\"otter, Tobias Lutz","submitted_at":"2009-06-08T21:39:44Z","abstract_excerpt":"Consider a relay cascade, i.e. a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose the source and a subset of the relays wish to communicate independent information to the sink under the condition that each relay in the cascade is half-duplex constrained. A coding scheme is developed which transfers information by an information-dependent allocation of the transmission and reception slots of the relays. The coding scheme requires synchronizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.1599","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":""},"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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2NO16E3YMm/P+Q7qbwmFdVGjqUEjTaXb5qbgkgvbXBnL2S6sT03GCSend/VzVBHpeUkDz8QYi2o8pkOUqhCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:30:32.715825Z"},"content_sha256":"613203b1da9b7910ba6c7819624f8b0f82ca8f9e7603204ef88fb9a5dc090350","schema_version":"1.0","event_id":"sha256:613203b1da9b7910ba6c7819624f8b0f82ca8f9e7603204ef88fb9a5dc090350"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/bundle.json","state_url":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/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-03T07:30:32Z","links":{"resolver":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR","bundle":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/bundle.json","state":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:2QGHWSWJFJ2FUWSYAWWE6HRNGR","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":"21ed9de394fbb28ac3bc82d9b80fb7a5e7dd4194de41717d408d2875e60d2350","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-08T21:39:44Z","title_canon_sha256":"04c9730c5e550b29f66bf1a56aa1f6b3a32ccdb641e22cd0b762f0d7c572cb2c"},"schema_version":"1.0","source":{"id":"0906.1599","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.1599","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0906.1599v3","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.1599","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"2QGHWSWJFJ2F","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2QGHWSWJFJ2FUWSY","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2QGHWSWJ","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:613203b1da9b7910ba6c7819624f8b0f82ca8f9e7603204ef88fb9a5dc090350","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"Consider a relay cascade, i.e. a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose the source and a subset of the relays wish to communicate independent information to the sink under the condition that each relay in the cascade is half-duplex constrained. A coding scheme is developed which transfers information by an information-dependent allocation of the transmission and reception slots of the relays. The coding scheme requires synchronizati","authors_text":"Christoph Hausl, Ralf K\\\"otter, Tobias Lutz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-08T21:39:44Z","title":"Bits Through Deterministic Relay Cascades with Half-Duplex Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.1599","kind":"arxiv","version":3},"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:6036ac6f61c10db4e98f840610bdb433e33a35347a6cfb55adddf68d42cfefcf","target":"record","created_at":"2026-05-18T00:58:48Z","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":"21ed9de394fbb28ac3bc82d9b80fb7a5e7dd4194de41717d408d2875e60d2350","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-08T21:39:44Z","title_canon_sha256":"04c9730c5e550b29f66bf1a56aa1f6b3a32ccdb641e22cd0b762f0d7c572cb2c"},"schema_version":"1.0","source":{"id":"0906.1599","kind":"arxiv","version":3}},"canonical_sha256":"d40c7b4ac92a745a5a5805ac4f1e2d3478965e27ef3df3ffab16c6c16d32b8c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d40c7b4ac92a745a5a5805ac4f1e2d3478965e27ef3df3ffab16c6c16d32b8c8","first_computed_at":"2026-05-18T00:58:48.064630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.064630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JUrobPtf0LE+HYoEscaEls5pxToNi8AtVIb0rsuBvdUOESLVCpHD19W/aCdPyhqFtwDM0BLrfHAhhZhHCJ+cCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.065125Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.1599","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6036ac6f61c10db4e98f840610bdb433e33a35347a6cfb55adddf68d42cfefcf","sha256:613203b1da9b7910ba6c7819624f8b0f82ca8f9e7603204ef88fb9a5dc090350"],"state_sha256":"0b8b688464f426d147932cf43dd3f2572ad76cf7f2eb7e24173379d05e0b0928"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F7OFQHEPrJH/OrHGmCKQEd+A8/z3kCEs2fDU8jnm5f98y8FrFhy+Sye18zelSwF7T0E1NBrjMSO/ULwl5ZTqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:30:32.717772Z","bundle_sha256":"ec4caa99a9e1789f126422b3d6c48933b1512f46a7421b1b2e78a40334dcc3fd"}}