{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IVK3CTRR6GKQ5UROQOAB2HVGVE","short_pith_number":"pith:IVK3CTRR","schema_version":"1.0","canonical_sha256":"4555b14e31f1950ed22e83801d1ea6a932170e8df14a180ce61d23299ddcd751","source":{"kind":"arxiv","id":"1202.3914","version":2},"attestation_state":"computed","paper":{"title":"A formal proof of the optimal frame setting for Dynamic-Frame Aloha with known population size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Flaminio Borgonovo, Luca Barletta, Matteo Cesana","submitted_at":"2012-02-17T14:20:17Z","abstract_excerpt":"In Dynamic-Frame Aloha subsequent frame lengths must be optimally chosen to maximize throughput. When the initial population size ${\\cal N}$ is known, numerical evaluations show that the maximum efficiency is achieved by setting the frame length equal to the backlog size at each subsequent frame; however, at best of our knowledge, a formal proof of this result is still missing, and is provided here. As byproduct, we also prove that the asymptotical efficiency in the optimal case is $e^{-1}$, provide upper and lower bounds for the length of the entire transmission period and show that its asymp"},"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":"1202.3914","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-17T14:20:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f772fb1010e051e2e60d09f5554fecc354ba8303bc091751064792f28e8e67a2","abstract_canon_sha256":"1aa5d075701bad5c512b49d8e0d2c7dc7d165cc5890c9a0f8635a78a0803987e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:09.815960Z","signature_b64":"kdU0Kk609xiv99TXzBiqmnHGE+FCJmyG69FHH/qMpCSIn47WQ5YkvafYD0Db67t7HTBR0/ThCCSYxZ0qC6YHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4555b14e31f1950ed22e83801d1ea6a932170e8df14a180ce61d23299ddcd751","last_reissued_at":"2026-05-18T00:59:09.815291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:09.815291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A formal proof of the optimal frame setting for Dynamic-Frame Aloha with known population size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Flaminio Borgonovo, Luca Barletta, Matteo Cesana","submitted_at":"2012-02-17T14:20:17Z","abstract_excerpt":"In Dynamic-Frame Aloha subsequent frame lengths must be optimally chosen to maximize throughput. When the initial population size ${\\cal N}$ is known, numerical evaluations show that the maximum efficiency is achieved by setting the frame length equal to the backlog size at each subsequent frame; however, at best of our knowledge, a formal proof of this result is still missing, and is provided here. As byproduct, we also prove that the asymptotical efficiency in the optimal case is $e^{-1}$, provide upper and lower bounds for the length of the entire transmission period and show that its asymp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3914","kind":"arxiv","version":2},"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":"1202.3914","created_at":"2026-05-18T00:59:09.815406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3914v2","created_at":"2026-05-18T00:59:09.815406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3914","created_at":"2026-05-18T00:59:09.815406+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVK3CTRR6GKQ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVK3CTRR6GKQ5URO","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVK3CTRR","created_at":"2026-05-18T12:27:09.501522+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/IVK3CTRR6GKQ5UROQOAB2HVGVE","json":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE.json","graph_json":"https://pith.science/api/pith-number/IVK3CTRR6GKQ5UROQOAB2HVGVE/graph.json","events_json":"https://pith.science/api/pith-number/IVK3CTRR6GKQ5UROQOAB2HVGVE/events.json","paper":"https://pith.science/paper/IVK3CTRR"},"agent_actions":{"view_html":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE","download_json":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE.json","view_paper":"https://pith.science/paper/IVK3CTRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3914&json=true","fetch_graph":"https://pith.science/api/pith-number/IVK3CTRR6GKQ5UROQOAB2HVGVE/graph.json","fetch_events":"https://pith.science/api/pith-number/IVK3CTRR6GKQ5UROQOAB2HVGVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/action/storage_attestation","attest_author":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/action/author_attestation","sign_citation":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/action/citation_signature","submit_replication":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/action/replication_record"}},"created_at":"2026-05-18T00:59:09.815406+00:00","updated_at":"2026-05-18T00:59:09.815406+00:00"}