{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IVK3CTRR6GKQ5UROQOAB2HVGVE","short_pith_number":"pith:IVK3CTRR","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"},"canonical_sha256":"4555b14e31f1950ed22e83801d1ea6a932170e8df14a180ce61d23299ddcd751","source":{"kind":"arxiv","id":"1202.3914","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3914","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3914v2","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3914","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"IVK3CTRR6GKQ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IVK3CTRR6GKQ5URO","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IVK3CTRR","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IVK3CTRR6GKQ5UROQOAB2HVGVE","target":"record","payload":{"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"},"canonical_sha256":"4555b14e31f1950ed22e83801d1ea6a932170e8df14a180ce61d23299ddcd751","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"},"source_kind":"arxiv","source_id":"1202.3914","source_version":2,"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-18T00:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZ6r6LTJ/MChG+FS+2Hp248qgwT1SvOoLnxlLz0fSgExb4zeTlXADVo33UzmzHz/h+8XrAGDRThDS4xAzJ2NBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T01:45:53.574702Z"},"content_sha256":"a1aa06adc87700968c8ae07c565ee2e332d937492c845902ce70a69befc79ad7","schema_version":"1.0","event_id":"sha256:a1aa06adc87700968c8ae07c565ee2e332d937492c845902ce70a69befc79ad7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IVK3CTRR6GKQ5UROQOAB2HVGVE","target":"graph","payload":{"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"},"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-18T00:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7o49xmk9uU8mvNP6GHwzf9tdiJMBis+dBlQHKpqYZ07PuQuc0qSPilsUrm7lHaIGcFD+84gVwmAaoatapiKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T01:45:53.575466Z"},"content_sha256":"99e7ff5649e9f63ac4c8e5eb1ff00152552037b25f1f08907cd4891fef194fad","schema_version":"1.0","event_id":"sha256:99e7ff5649e9f63ac4c8e5eb1ff00152552037b25f1f08907cd4891fef194fad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/bundle.json","state_url":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/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-05-24T01:45:53Z","links":{"resolver":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE","bundle":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/bundle.json","state":"https://pith.science/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVK3CTRR6GKQ5UROQOAB2HVGVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IVK3CTRR6GKQ5UROQOAB2HVGVE","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":"1aa5d075701bad5c512b49d8e0d2c7dc7d165cc5890c9a0f8635a78a0803987e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-17T14:20:17Z","title_canon_sha256":"f772fb1010e051e2e60d09f5554fecc354ba8303bc091751064792f28e8e67a2"},"schema_version":"1.0","source":{"id":"1202.3914","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3914","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3914v2","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3914","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"IVK3CTRR6GKQ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IVK3CTRR6GKQ5URO","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IVK3CTRR","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:99e7ff5649e9f63ac4c8e5eb1ff00152552037b25f1f08907cd4891fef194fad","target":"graph","created_at":"2026-05-18T00:59:09Z","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":"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","authors_text":"Flaminio Borgonovo, Luca Barletta, Matteo Cesana","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-17T14:20:17Z","title":"A formal proof of the optimal frame setting for Dynamic-Frame Aloha with known population size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3914","kind":"arxiv","version":2},"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:a1aa06adc87700968c8ae07c565ee2e332d937492c845902ce70a69befc79ad7","target":"record","created_at":"2026-05-18T00:59:09Z","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":"1aa5d075701bad5c512b49d8e0d2c7dc7d165cc5890c9a0f8635a78a0803987e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-17T14:20:17Z","title_canon_sha256":"f772fb1010e051e2e60d09f5554fecc354ba8303bc091751064792f28e8e67a2"},"schema_version":"1.0","source":{"id":"1202.3914","kind":"arxiv","version":2}},"canonical_sha256":"4555b14e31f1950ed22e83801d1ea6a932170e8df14a180ce61d23299ddcd751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4555b14e31f1950ed22e83801d1ea6a932170e8df14a180ce61d23299ddcd751","first_computed_at":"2026-05-18T00:59:09.815291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:09.815291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kdU0Kk609xiv99TXzBiqmnHGE+FCJmyG69FHH/qMpCSIn47WQ5YkvafYD0Db67t7HTBR0/ThCCSYxZ0qC6YHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:09.815960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3914","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1aa06adc87700968c8ae07c565ee2e332d937492c845902ce70a69befc79ad7","sha256:99e7ff5649e9f63ac4c8e5eb1ff00152552037b25f1f08907cd4891fef194fad"],"state_sha256":"b73ed90327e8fe5865a2488ca722c64d783dadc8562793ba7d57c6c27861287d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAfbXLQNGk9N88CHNASSOr1uSc24JIQfHl/rMZrjy8xiBOJYhJk5+81pWkJhn4xaWCFmPW4QvOJQ9lNr30UqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T01:45:53.579122Z","bundle_sha256":"671daf9615208e53588d7bedbee014b16f371cc5e9dc2af673baf21e5c2ba184"}}