{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EBW2BQKRGDQ3VD6SMJ5TVLFQ2F","short_pith_number":"pith:EBW2BQKR","schema_version":"1.0","canonical_sha256":"206da0c15130e1ba8fd2627b3aacb0d16a67c2332b631d724bc94f867d17f091","source":{"kind":"arxiv","id":"1603.02000","version":1},"attestation_state":"computed","paper":{"title":"Identifying Randomly Activated Users via Sign-Compute-Resolve on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cedomir Stefanovic, Dejan Vukobratovic, Jasper Goseling, Petar Popovski","submitted_at":"2016-03-07T10:53:24Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1603.02000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-07T10:53:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"94c35a88fdd6eb9e20a1d68bf5e75dd63c4137a264805b19b0d60eb42d3da46a","abstract_canon_sha256":"44f95a7984b653d17c5aa60c926dd35d0def9200e1052f4fcee98c8119f06651"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:49.841893Z","signature_b64":"XgL/0bjl8EZi+DqV0t22sWY2qBZbmJ3CfDgthXwAWMHgYC23RRbitcLjZJJfWC84e0RtRo83GM4MSjhfuez1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"206da0c15130e1ba8fd2627b3aacb0d16a67c2332b631d724bc94f867d17f091","last_reissued_at":"2026-05-18T00:57:49.841347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:49.841347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying Randomly Activated Users via Sign-Compute-Resolve on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cedomir Stefanovic, Dejan Vukobratovic, Jasper Goseling, Petar Popovski","submitted_at":"2016-03-07T10:53:24Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02000","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.02000","created_at":"2026-05-18T00:57:49.841434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02000v1","created_at":"2026-05-18T00:57:49.841434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02000","created_at":"2026-05-18T00:57:49.841434+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBW2BQKRGDQ3","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBW2BQKRGDQ3VD6S","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBW2BQKR","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F","json":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F.json","graph_json":"https://pith.science/api/pith-number/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/graph.json","events_json":"https://pith.science/api/pith-number/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/events.json","paper":"https://pith.science/paper/EBW2BQKR"},"agent_actions":{"view_html":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F","download_json":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F.json","view_paper":"https://pith.science/paper/EBW2BQKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02000&json=true","fetch_graph":"https://pith.science/api/pith-number/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/graph.json","fetch_events":"https://pith.science/api/pith-number/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/action/storage_attestation","attest_author":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/action/author_attestation","sign_citation":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/action/citation_signature","submit_replication":"https://pith.science/pith/EBW2BQKRGDQ3VD6SMJ5TVLFQ2F/action/replication_record"}},"created_at":"2026-05-18T00:57:49.841434+00:00","updated_at":"2026-05-18T00:57:49.841434+00:00"}