{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MYUFXZMTI4A4XUPC7N5NVQAUDX","short_pith_number":"pith:MYUFXZMT","canonical_record":{"source":{"id":"1301.7232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-30T14:13:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f34843d9a037e3d7c5c2d780e0927e8a90bbce271a131c43c8321cd6b6740abb","abstract_canon_sha256":"8bd1ff3a4f391b414db39e52e775d89ae1da852b78a39aec9bf799e9165bfbcd"},"schema_version":"1.0"},"canonical_sha256":"66285be5934701cbd1e2fb7adac0141dd851f0877e9ceb841f6f9742260a9738","source":{"kind":"arxiv","id":"1301.7232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7232","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7232v1","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7232","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"MYUFXZMTI4A4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MYUFXZMTI4A4XUPC","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MYUFXZMT","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MYUFXZMTI4A4XUPC7N5NVQAUDX","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-30T14:13:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f34843d9a037e3d7c5c2d780e0927e8a90bbce271a131c43c8321cd6b6740abb","abstract_canon_sha256":"8bd1ff3a4f391b414db39e52e775d89ae1da852b78a39aec9bf799e9165bfbcd"},"schema_version":"1.0"},"canonical_sha256":"66285be5934701cbd1e2fb7adac0141dd851f0877e9ceb841f6f9742260a9738","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:00.883480Z","signature_b64":"Unj70aAEYFMgLxEqipVKZQSwiK6uLdOyAt6Vg07RHfLoXgyDOp9MilmiMDN/TzdtEFMgt505SFEVy0KAUZvwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66285be5934701cbd1e2fb7adac0141dd851f0877e9ceb841f6f9742260a9738","last_reissued_at":"2026-05-18T03:35:00.882761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:00.882761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7232","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-18T03:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GE2VfdW8SqboIMOY7qAW1TXXbL9zL2bVxOGrsAuS+9KDuCKRIPRpD9MOwzjt9NE1paNVaVENSPyzgzp96bAyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:45:29.961991Z"},"content_sha256":"d04b38c010d33476f3029dbb2e42b683aaa3250b0e2cab4492dd0dfd7d68e200","schema_version":"1.0","event_id":"sha256:d04b38c010d33476f3029dbb2e42b683aaa3250b0e2cab4492dd0dfd7d68e200"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MYUFXZMTI4A4XUPC7N5NVQAUDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Splitting Tree Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cedomir Stefanovi\\'c, Jesper H. S{\\o}rensen, Petar Popovski","submitted_at":"2013-01-30T14:13:14Z","abstract_excerpt":"This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7232","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-18T03:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtalnoTfM+DtyloDdqhFBZnFMGSh6ULoMmsZzvFm7jStp3EUJIqns5yegkacaTwA86V3Hjus33CVAl4bCd8vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:45:29.962636Z"},"content_sha256":"bfade37b64f1b301dce38930d542a080e3772644a2ec9cafdf3d1cd7bac291a7","schema_version":"1.0","event_id":"sha256:bfade37b64f1b301dce38930d542a080e3772644a2ec9cafdf3d1cd7bac291a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYUFXZMTI4A4XUPC7N5NVQAUDX/bundle.json","state_url":"https://pith.science/pith/MYUFXZMTI4A4XUPC7N5NVQAUDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYUFXZMTI4A4XUPC7N5NVQAUDX/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-05-27T00:45:29Z","links":{"resolver":"https://pith.science/pith/MYUFXZMTI4A4XUPC7N5NVQAUDX","bundle":"https://pith.science/pith/MYUFXZMTI4A4XUPC7N5NVQAUDX/bundle.json","state":"https://pith.science/pith/MYUFXZMTI4A4XUPC7N5NVQAUDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYUFXZMTI4A4XUPC7N5NVQAUDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MYUFXZMTI4A4XUPC7N5NVQAUDX","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":"8bd1ff3a4f391b414db39e52e775d89ae1da852b78a39aec9bf799e9165bfbcd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-30T14:13:14Z","title_canon_sha256":"f34843d9a037e3d7c5c2d780e0927e8a90bbce271a131c43c8321cd6b6740abb"},"schema_version":"1.0","source":{"id":"1301.7232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7232","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7232v1","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7232","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"MYUFXZMTI4A4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MYUFXZMTI4A4XUPC","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MYUFXZMT","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:bfade37b64f1b301dce38930d542a080e3772644a2ec9cafdf3d1cd7bac291a7","target":"graph","created_at":"2026-05-18T03:35:00Z","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":"This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early as ","authors_text":"Cedomir Stefanovi\\'c, Jesper H. S{\\o}rensen, Petar Popovski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-30T14:13:14Z","title":"Coded Splitting Tree Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7232","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:d04b38c010d33476f3029dbb2e42b683aaa3250b0e2cab4492dd0dfd7d68e200","target":"record","created_at":"2026-05-18T03:35:00Z","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":"8bd1ff3a4f391b414db39e52e775d89ae1da852b78a39aec9bf799e9165bfbcd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-30T14:13:14Z","title_canon_sha256":"f34843d9a037e3d7c5c2d780e0927e8a90bbce271a131c43c8321cd6b6740abb"},"schema_version":"1.0","source":{"id":"1301.7232","kind":"arxiv","version":1}},"canonical_sha256":"66285be5934701cbd1e2fb7adac0141dd851f0877e9ceb841f6f9742260a9738","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66285be5934701cbd1e2fb7adac0141dd851f0877e9ceb841f6f9742260a9738","first_computed_at":"2026-05-18T03:35:00.882761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:00.882761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Unj70aAEYFMgLxEqipVKZQSwiK6uLdOyAt6Vg07RHfLoXgyDOp9MilmiMDN/TzdtEFMgt505SFEVy0KAUZvwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:00.883480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d04b38c010d33476f3029dbb2e42b683aaa3250b0e2cab4492dd0dfd7d68e200","sha256:bfade37b64f1b301dce38930d542a080e3772644a2ec9cafdf3d1cd7bac291a7"],"state_sha256":"38d82fece673c7f42b91255de979b7b61f70f316ea770203db340c04410cae15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iFXfDH9TamOE7U7uogRuGikZ0SR//CCJpTxZEFQmBho2tKAihvDPcFT8beT2/FA4hRvLLWMM2+0dbvAN/qvzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:45:29.965353Z","bundle_sha256":"6660ecf1d2cbc9ab74202130b5950e373b79a615784fd07834d8c218f0f71da1"}}