{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IW3OMW7XDAUIBVCFXNP77S3B7Q","short_pith_number":"pith:IW3OMW7X","schema_version":"1.0","canonical_sha256":"45b6e65bf7182880d445bb5fffcb61fc229019835ff173d9b6c9d5e45278cb1c","source":{"kind":"arxiv","id":"1308.0907","version":1},"attestation_state":"computed","paper":{"title":"The complexity of resolving conflicts on MAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shailesh Vaya","submitted_at":"2013-08-05T08:58:32Z","abstract_excerpt":"We consider the fundamental problem of multiple stations competing to transmit on a multiple access channel (MAC). We are given $n$ stations out of which at most $d$ are active and intend to transmit a message to other stations using MAC. All stations are assumed to be synchronized according to a time clock. If $l$ stations node transmit in the same round, then the MAC provides the feedback whether $l=0$, $l=2$ (collision occurred) or $l=1$. When $l=1$, then a single station is indeed able to successfully transmit a message, which is received by all other nodes. For the above problem the activ"},"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":"1308.0907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-05T08:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"8cc1b212f1f4f4505941c45e9b660f0eed2dc70451a6ef7b67fd8e1c6b06f153","abstract_canon_sha256":"78ef985eaa0f44bd9ea0d9d8ffce02f666e977a59dd4384e2b7ed30ab646e9c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:41.196365Z","signature_b64":"M/2z03IJ/2S8eIrF3az+BXLYYmTcrd5QmgjtSNHtglLPzQaXZ7Kb+FSFuNYOLky6NsGkTJn58wCXtl7aPY5DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45b6e65bf7182880d445bb5fffcb61fc229019835ff173d9b6c9d5e45278cb1c","last_reissued_at":"2026-05-18T03:16:41.195693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:41.195693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of resolving conflicts on MAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shailesh Vaya","submitted_at":"2013-08-05T08:58:32Z","abstract_excerpt":"We consider the fundamental problem of multiple stations competing to transmit on a multiple access channel (MAC). We are given $n$ stations out of which at most $d$ are active and intend to transmit a message to other stations using MAC. All stations are assumed to be synchronized according to a time clock. If $l$ stations node transmit in the same round, then the MAC provides the feedback whether $l=0$, $l=2$ (collision occurred) or $l=1$. When $l=1$, then a single station is indeed able to successfully transmit a message, which is received by all other nodes. For the above problem the activ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0907","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":"1308.0907","created_at":"2026-05-18T03:16:41.195789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0907v1","created_at":"2026-05-18T03:16:41.195789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0907","created_at":"2026-05-18T03:16:41.195789+00:00"},{"alias_kind":"pith_short_12","alias_value":"IW3OMW7XDAUI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"IW3OMW7XDAUIBVCF","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"IW3OMW7X","created_at":"2026-05-18T12:27:49.015174+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/IW3OMW7XDAUIBVCFXNP77S3B7Q","json":"https://pith.science/pith/IW3OMW7XDAUIBVCFXNP77S3B7Q.json","graph_json":"https://pith.science/api/pith-number/IW3OMW7XDAUIBVCFXNP77S3B7Q/graph.json","events_json":"https://pith.science/api/pith-number/IW3OMW7XDAUIBVCFXNP77S3B7Q/events.json","paper":"https://pith.science/paper/IW3OMW7X"},"agent_actions":{"view_html":"https://pith.science/pith/IW3OMW7XDAUIBVCFXNP77S3B7Q","download_json":"https://pith.science/pith/IW3OMW7XDAUIBVCFXNP77S3B7Q.json","view_paper":"https://pith.science/paper/IW3OMW7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0907&json=true","fetch_graph":"https://pith.science/api/pith-number/IW3OMW7XDAUIBVCFXNP77S3B7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/IW3OMW7XDAUIBVCFXNP77S3B7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IW3OMW7XDAUIBVCFXNP77S3B7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IW3OMW7XDAUIBVCFXNP77S3B7Q/action/storage_attestation","attest_author":"https://pith.science/pith/IW3OMW7XDAUIBVCFXNP77S3B7Q/action/author_attestation","sign_citation":"https://pith.science/pith/IW3OMW7XDAUIBVCFXNP77S3B7Q/action/citation_signature","submit_replication":"https://pith.science/pith/IW3OMW7XDAUIBVCFXNP77S3B7Q/action/replication_record"}},"created_at":"2026-05-18T03:16:41.195789+00:00","updated_at":"2026-05-18T03:16:41.195789+00:00"}