{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MF7EZJR3EFUDYNZD5YEK3EERYG","short_pith_number":"pith:MF7EZJR3","canonical_record":{"source":{"id":"1207.6174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-26T06:02:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c264aa3b1e1daa38bdcd546798380d3551012779e10c4b7cb67039b526de564","abstract_canon_sha256":"456da17c2cd5b612704bc3753862b271ac8180a6d012323d5ed43a464c2336bc"},"schema_version":"1.0"},"canonical_sha256":"617e4ca63b21683c3723ee08ad9091c1b763c24ff63bdc758e037020761668dd","source":{"kind":"arxiv","id":"1207.6174","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6174","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6174v1","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6174","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"MF7EZJR3EFUD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MF7EZJR3EFUDYNZD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MF7EZJR3","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MF7EZJR3EFUDYNZD5YEK3EERYG","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-26T06:02:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c264aa3b1e1daa38bdcd546798380d3551012779e10c4b7cb67039b526de564","abstract_canon_sha256":"456da17c2cd5b612704bc3753862b271ac8180a6d012323d5ed43a464c2336bc"},"schema_version":"1.0"},"canonical_sha256":"617e4ca63b21683c3723ee08ad9091c1b763c24ff63bdc758e037020761668dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:08.647825Z","signature_b64":"8uCF1YZdP/FFX/0pYKpDuCiANJDTJZzStq+TdjgNUbN2MDm7b4DEPDV/6eL7tDkw5OxEjY6kIOrao3qb+62CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"617e4ca63b21683c3723ee08ad9091c1b763c24ff63bdc758e037020761668dd","last_reissued_at":"2026-05-18T03:50:08.647047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:08.647047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6174","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:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MI5nEVq2ZjUECUeFX8lluL9vPHwhg+NKSf1oG1hLqxIhug6Q8khIDDtYnylXw3xnfmCeKn87gSH6A3Bluc2zAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:57:06.721027Z"},"content_sha256":"e5f75d39a5dfe06e77a2c6c1ca8f1fe909c7cac642ea426c065607791064de09","schema_version":"1.0","event_id":"sha256:e5f75d39a5dfe06e77a2c6c1ca8f1fe909c7cac642ea426c065607791064de09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MF7EZJR3EFUDYNZD5YEK3EERYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A++ Random Access for Two-way Relaying in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Wenguang Mao, Xudong Wang","submitted_at":"2012-07-26T06:02:56Z","abstract_excerpt":"Two-way relaying can significantly improve performance of next generation wireless networks. However, due to its dependence on multi-node cooperation and transmission coordination, applying this technique to a wireless network in an effective and scalable manner poses a challenging problem. To tackle this problem without relying on complicated scheduling or network optimization algorithms, we propose a scalable random access scheme that takes measures in both the physical layer and the medium access control layer. Specifically, we propose a two-way relaying technique that supports fully asynch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6174","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:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1DmaYX5Jtwr+RTUutRK887cR7+n2sXatR4GXqU7IQFVs892IW3VhrDcOgC5rolmQ2s+QcdhTJYM+O51/xI+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:57:06.721733Z"},"content_sha256":"971aaa64bddf7f2408ed05104fe779985787f9447419ecab5c91fd6ddced93d1","schema_version":"1.0","event_id":"sha256:971aaa64bddf7f2408ed05104fe779985787f9447419ecab5c91fd6ddced93d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MF7EZJR3EFUDYNZD5YEK3EERYG/bundle.json","state_url":"https://pith.science/pith/MF7EZJR3EFUDYNZD5YEK3EERYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MF7EZJR3EFUDYNZD5YEK3EERYG/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-06T03:57:06Z","links":{"resolver":"https://pith.science/pith/MF7EZJR3EFUDYNZD5YEK3EERYG","bundle":"https://pith.science/pith/MF7EZJR3EFUDYNZD5YEK3EERYG/bundle.json","state":"https://pith.science/pith/MF7EZJR3EFUDYNZD5YEK3EERYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MF7EZJR3EFUDYNZD5YEK3EERYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MF7EZJR3EFUDYNZD5YEK3EERYG","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":"456da17c2cd5b612704bc3753862b271ac8180a6d012323d5ed43a464c2336bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-26T06:02:56Z","title_canon_sha256":"6c264aa3b1e1daa38bdcd546798380d3551012779e10c4b7cb67039b526de564"},"schema_version":"1.0","source":{"id":"1207.6174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6174","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6174v1","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6174","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"MF7EZJR3EFUD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MF7EZJR3EFUDYNZD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MF7EZJR3","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:971aaa64bddf7f2408ed05104fe779985787f9447419ecab5c91fd6ddced93d1","target":"graph","created_at":"2026-05-18T03:50:08Z","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":"Two-way relaying can significantly improve performance of next generation wireless networks. However, due to its dependence on multi-node cooperation and transmission coordination, applying this technique to a wireless network in an effective and scalable manner poses a challenging problem. To tackle this problem without relying on complicated scheduling or network optimization algorithms, we propose a scalable random access scheme that takes measures in both the physical layer and the medium access control layer. Specifically, we propose a two-way relaying technique that supports fully asynch","authors_text":"Wenguang Mao, Xudong Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-26T06:02:56Z","title":"A++ Random Access for Two-way Relaying in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6174","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:e5f75d39a5dfe06e77a2c6c1ca8f1fe909c7cac642ea426c065607791064de09","target":"record","created_at":"2026-05-18T03:50:08Z","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":"456da17c2cd5b612704bc3753862b271ac8180a6d012323d5ed43a464c2336bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-26T06:02:56Z","title_canon_sha256":"6c264aa3b1e1daa38bdcd546798380d3551012779e10c4b7cb67039b526de564"},"schema_version":"1.0","source":{"id":"1207.6174","kind":"arxiv","version":1}},"canonical_sha256":"617e4ca63b21683c3723ee08ad9091c1b763c24ff63bdc758e037020761668dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"617e4ca63b21683c3723ee08ad9091c1b763c24ff63bdc758e037020761668dd","first_computed_at":"2026-05-18T03:50:08.647047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:08.647047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8uCF1YZdP/FFX/0pYKpDuCiANJDTJZzStq+TdjgNUbN2MDm7b4DEPDV/6eL7tDkw5OxEjY6kIOrao3qb+62CBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:08.647825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5f75d39a5dfe06e77a2c6c1ca8f1fe909c7cac642ea426c065607791064de09","sha256:971aaa64bddf7f2408ed05104fe779985787f9447419ecab5c91fd6ddced93d1"],"state_sha256":"74966551807a7cd0d6b4890b7eced350973b3c85ec5b304c782e3bbcb64c0668"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TK3YDyXzgxWozw5PxtHwcoG4C5kIHFJoePYgldbfvSfO/zLLy+8xGIO9a+ivijijNkNYh6HJwqpMMHonbr/5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:57:06.725358Z","bundle_sha256":"1dc235abcde9549d8b6e0b18f5d5e542708c74c662b9ac48206f6d12ca9b1911"}}