{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XPBO43UVNY2TH6YXH7BRO3NIDT","short_pith_number":"pith:XPBO43UV","canonical_record":{"source":{"id":"1509.05939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T21:52:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4afd18dd50d3f9e75df97dce4975c3221da77f50c5e6bc7d716bb00c1a4a45f3","abstract_canon_sha256":"00b36a79f3b6b50ef35998d1dd7c880d7d862e369fb4c94b3c3fbcb1c051d9e6"},"schema_version":"1.0"},"canonical_sha256":"bbc2ee6e956e3533fb173fc3176da81cf9db161d094b519a8d28b7d812676fed","source":{"kind":"arxiv","id":"1509.05939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05939","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05939v1","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05939","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"pith_short_12","alias_value":"XPBO43UVNY2T","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XPBO43UVNY2TH6YX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XPBO43UV","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XPBO43UVNY2TH6YXH7BRO3NIDT","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T21:52:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4afd18dd50d3f9e75df97dce4975c3221da77f50c5e6bc7d716bb00c1a4a45f3","abstract_canon_sha256":"00b36a79f3b6b50ef35998d1dd7c880d7d862e369fb4c94b3c3fbcb1c051d9e6"},"schema_version":"1.0"},"canonical_sha256":"bbc2ee6e956e3533fb173fc3176da81cf9db161d094b519a8d28b7d812676fed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:36.318915Z","signature_b64":"bihlLv8ViUb6bsW05Nwf/1LdjPHF2d7Av/dTTSSUaUao8pKJiP+HRZbB+/OgK2V7vY+tZwrRhhPoW/am72CbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbc2ee6e956e3533fb173fc3176da81cf9db161d094b519a8d28b7d812676fed","last_reissued_at":"2026-05-18T01:32:36.318489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:36.318489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05939","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-18T01:32:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hg0f2N2rPnHpogYV7KhAsXbLUZVgAnRgaaUjQO4g2hrJZ5RHEyoysR6Kjxl+ff7c9u+iadND5brYESiEApCWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:19:16.475115Z"},"content_sha256":"8013ede053c115d3bac870a5cf47d6408cd0d4f8a6384137bdb3e1c35e1587ff","schema_version":"1.0","event_id":"sha256:8013ede053c115d3bac870a5cf47d6408cd0d4f8a6384137bdb3e1c35e1587ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XPBO43UVNY2TH6YXH7BRO3NIDT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Analysis of CSMA Scheduling via Dependencies Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Azarafrooz, R. Chandramouli","submitted_at":"2015-09-19T21:52:29Z","abstract_excerpt":"The complexity of a CSMA algorithm has been translated to the norm properties of a dependencies matrix.\n  The maximum throughput optimization is reformulated by including the dependencies matrix in the formulations. It has been shown that for the interference graphs $\\mathcal{G}$ that have minimum vertex cover size $\\mathcal{C}(\\mathcal{G})=\\log n$ where $n$ is the number of the links, the optimal strategy of the links is to transmit with the probability 1, i.e a service-rate agnostic approach.\n  Several numerical analyses have been conducted in order to illustrate the effect of the interferen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05939","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-18T01:32:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2eB4qZhdPtDyKl2V/R2RKNEGYXEqhO6Vbde23NHRrzsZcL4oNAo58BGo6xpTBNBP/Ku4GwK4NRuBaao4VBxaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:19:16.475819Z"},"content_sha256":"0364e60e6ea2309504fe38cc2d180d8c6d70979e40a9bf81da65020ad5685db1","schema_version":"1.0","event_id":"sha256:0364e60e6ea2309504fe38cc2d180d8c6d70979e40a9bf81da65020ad5685db1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPBO43UVNY2TH6YXH7BRO3NIDT/bundle.json","state_url":"https://pith.science/pith/XPBO43UVNY2TH6YXH7BRO3NIDT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPBO43UVNY2TH6YXH7BRO3NIDT/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-06T13:19:16Z","links":{"resolver":"https://pith.science/pith/XPBO43UVNY2TH6YXH7BRO3NIDT","bundle":"https://pith.science/pith/XPBO43UVNY2TH6YXH7BRO3NIDT/bundle.json","state":"https://pith.science/pith/XPBO43UVNY2TH6YXH7BRO3NIDT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPBO43UVNY2TH6YXH7BRO3NIDT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XPBO43UVNY2TH6YXH7BRO3NIDT","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":"00b36a79f3b6b50ef35998d1dd7c880d7d862e369fb4c94b3c3fbcb1c051d9e6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T21:52:29Z","title_canon_sha256":"4afd18dd50d3f9e75df97dce4975c3221da77f50c5e6bc7d716bb00c1a4a45f3"},"schema_version":"1.0","source":{"id":"1509.05939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05939","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05939v1","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05939","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"pith_short_12","alias_value":"XPBO43UVNY2T","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XPBO43UVNY2TH6YX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XPBO43UV","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:0364e60e6ea2309504fe38cc2d180d8c6d70979e40a9bf81da65020ad5685db1","target":"graph","created_at":"2026-05-18T01:32:36Z","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":"The complexity of a CSMA algorithm has been translated to the norm properties of a dependencies matrix.\n  The maximum throughput optimization is reformulated by including the dependencies matrix in the formulations. It has been shown that for the interference graphs $\\mathcal{G}$ that have minimum vertex cover size $\\mathcal{C}(\\mathcal{G})=\\log n$ where $n$ is the number of the links, the optimal strategy of the links is to transmit with the probability 1, i.e a service-rate agnostic approach.\n  Several numerical analyses have been conducted in order to illustrate the effect of the interferen","authors_text":"Mahdi Azarafrooz, R. Chandramouli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T21:52:29Z","title":"Complexity Analysis of CSMA Scheduling via Dependencies Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05939","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:8013ede053c115d3bac870a5cf47d6408cd0d4f8a6384137bdb3e1c35e1587ff","target":"record","created_at":"2026-05-18T01:32:36Z","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":"00b36a79f3b6b50ef35998d1dd7c880d7d862e369fb4c94b3c3fbcb1c051d9e6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T21:52:29Z","title_canon_sha256":"4afd18dd50d3f9e75df97dce4975c3221da77f50c5e6bc7d716bb00c1a4a45f3"},"schema_version":"1.0","source":{"id":"1509.05939","kind":"arxiv","version":1}},"canonical_sha256":"bbc2ee6e956e3533fb173fc3176da81cf9db161d094b519a8d28b7d812676fed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbc2ee6e956e3533fb173fc3176da81cf9db161d094b519a8d28b7d812676fed","first_computed_at":"2026-05-18T01:32:36.318489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:36.318489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bihlLv8ViUb6bsW05Nwf/1LdjPHF2d7Av/dTTSSUaUao8pKJiP+HRZbB+/OgK2V7vY+tZwrRhhPoW/am72CbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:36.318915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8013ede053c115d3bac870a5cf47d6408cd0d4f8a6384137bdb3e1c35e1587ff","sha256:0364e60e6ea2309504fe38cc2d180d8c6d70979e40a9bf81da65020ad5685db1"],"state_sha256":"9276eb7afa8ecff928b73b6fc7232ac74f8b25eb1264692ab895cf55dcb3a12f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFrb6EBg6K9/Ez7ondALjZBcCN7JFhOhe4aPm14QBptL8BKnA2TL4vL53JbMpFyLPohjiy4bUhwX3V7/OU59Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:19:16.479504Z","bundle_sha256":"9f179213d54d9458f41f2d36cde47c99e91c776c3ee8cdc7b055c174db21f09a"}}