{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EBW2BQKRGDQ3VD6SMJ5TVLFQ2F","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":"44f95a7984b653d17c5aa60c926dd35d0def9200e1052f4fcee98c8119f06651","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-07T10:53:24Z","title_canon_sha256":"94c35a88fdd6eb9e20a1d68bf5e75dd63c4137a264805b19b0d60eb42d3da46a"},"schema_version":"1.0","source":{"id":"1603.02000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02000","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02000v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02000","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"EBW2BQKRGDQ3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EBW2BQKRGDQ3VD6S","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EBW2BQKR","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:c3e506c05307f251983fa56a2bb29fc4d9cefa176bf2aceab9e818036cf1abda","target":"graph","created_at":"2026-05-18T00:57:49Z","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":"In this paper we treat the problem of identification of a subset of active users in a set of a large number of potentially active users. The users from the subset are activated randomly, such that the access point (AP) does not know the subset or its size a priori. The active users are contending to report their activity to the AP over a multiple access channel. We devise a contention algorithm that assumes a combination of physical-layer network coding and K-out-of-N signature coding, allowing for multiple detection of up to K users at the access point. In addition, we rely on the principles ","authors_text":"Cedomir Stefanovic, Dejan Vukobratovic, Jasper Goseling, Petar Popovski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-07T10:53:24Z","title":"Identifying Randomly Activated Users via Sign-Compute-Resolve on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02000","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:5216a61f6a108ad780551c22a1b00f28acd031d9c6fd1c8de07a182ea0ffa59e","target":"record","created_at":"2026-05-18T00:57:49Z","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":"44f95a7984b653d17c5aa60c926dd35d0def9200e1052f4fcee98c8119f06651","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-07T10:53:24Z","title_canon_sha256":"94c35a88fdd6eb9e20a1d68bf5e75dd63c4137a264805b19b0d60eb42d3da46a"},"schema_version":"1.0","source":{"id":"1603.02000","kind":"arxiv","version":1}},"canonical_sha256":"206da0c15130e1ba8fd2627b3aacb0d16a67c2332b631d724bc94f867d17f091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"206da0c15130e1ba8fd2627b3aacb0d16a67c2332b631d724bc94f867d17f091","first_computed_at":"2026-05-18T00:57:49.841347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:49.841347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XgL/0bjl8EZi+DqV0t22sWY2qBZbmJ3CfDgthXwAWMHgYC23RRbitcLjZJJfWC84e0RtRo83GM4MSjhfuez1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:49.841893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5216a61f6a108ad780551c22a1b00f28acd031d9c6fd1c8de07a182ea0ffa59e","sha256:c3e506c05307f251983fa56a2bb29fc4d9cefa176bf2aceab9e818036cf1abda"],"state_sha256":"9391a8f5edcf300c04fb4f13abe518fa37b2137a968dd57002606622a5c334d9"}