{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Y3KET3KGICSNR63O44VQP3SUYN","short_pith_number":"pith:Y3KET3KG","schema_version":"1.0","canonical_sha256":"c6d449ed4640a4d8fb6ee72b07ee54c37d222d96609d1c1d73ba736191ae4588","source":{"kind":"arxiv","id":"1301.3185","version":1},"attestation_state":"computed","paper":{"title":"Distributed Admission Control without Knowledge of the Capacity Region","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Juan Jose Jaramillo, Lei Ying","submitted_at":"2013-01-14T23:51:48Z","abstract_excerpt":"We consider the problem of distributed admission control without knowledge of the capacity region in single-hop wireless networks, for flows that require a pre-specified bandwidth from the network. We present an optimization framework that allows us to design a scheduler and resource allocator, and by properly choosing a suitable utility function in the resource allocator, we prove that existing flows can be served with a pre-specified bandwidth, while the link requesting admission can determine the largest rate that it can get such that it does not interfere with the allocation to the existin"},"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":"1301.3185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-01-14T23:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"b0cf26618e6ff82c047fb3e548daacd6e6a4448e238afaa901a5dade96a152d2","abstract_canon_sha256":"cc3db2026a9ff71a24b2f63a0a06afb513d36ce248c5146ff73b92cda3be2e59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:26.297216Z","signature_b64":"m96g8DuFrK8fDzsECPLMByKHvQuUXKbp7bmET4ngyYDcqHGZhw8vH5wRz07HgKpCmPrC+cx3JigJS0ZqvfMyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6d449ed4640a4d8fb6ee72b07ee54c37d222d96609d1c1d73ba736191ae4588","last_reissued_at":"2026-05-18T03:36:26.296763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:26.296763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Admission Control without Knowledge of the Capacity Region","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Juan Jose Jaramillo, Lei Ying","submitted_at":"2013-01-14T23:51:48Z","abstract_excerpt":"We consider the problem of distributed admission control without knowledge of the capacity region in single-hop wireless networks, for flows that require a pre-specified bandwidth from the network. We present an optimization framework that allows us to design a scheduler and resource allocator, and by properly choosing a suitable utility function in the resource allocator, we prove that existing flows can be served with a pre-specified bandwidth, while the link requesting admission can determine the largest rate that it can get such that it does not interfere with the allocation to the existin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3185","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":"1301.3185","created_at":"2026-05-18T03:36:26.296831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3185v1","created_at":"2026-05-18T03:36:26.296831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3185","created_at":"2026-05-18T03:36:26.296831+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3KET3KGICSN","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3KET3KGICSNR63O","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3KET3KG","created_at":"2026-05-18T12:28:06.772260+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/Y3KET3KGICSNR63O44VQP3SUYN","json":"https://pith.science/pith/Y3KET3KGICSNR63O44VQP3SUYN.json","graph_json":"https://pith.science/api/pith-number/Y3KET3KGICSNR63O44VQP3SUYN/graph.json","events_json":"https://pith.science/api/pith-number/Y3KET3KGICSNR63O44VQP3SUYN/events.json","paper":"https://pith.science/paper/Y3KET3KG"},"agent_actions":{"view_html":"https://pith.science/pith/Y3KET3KGICSNR63O44VQP3SUYN","download_json":"https://pith.science/pith/Y3KET3KGICSNR63O44VQP3SUYN.json","view_paper":"https://pith.science/paper/Y3KET3KG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3185&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3KET3KGICSNR63O44VQP3SUYN/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3KET3KGICSNR63O44VQP3SUYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3KET3KGICSNR63O44VQP3SUYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3KET3KGICSNR63O44VQP3SUYN/action/storage_attestation","attest_author":"https://pith.science/pith/Y3KET3KGICSNR63O44VQP3SUYN/action/author_attestation","sign_citation":"https://pith.science/pith/Y3KET3KGICSNR63O44VQP3SUYN/action/citation_signature","submit_replication":"https://pith.science/pith/Y3KET3KGICSNR63O44VQP3SUYN/action/replication_record"}},"created_at":"2026-05-18T03:36:26.296831+00:00","updated_at":"2026-05-18T03:36:26.296831+00:00"}