{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C27V4Y2KZ3TD5PLGIZVDEKX2KH","short_pith_number":"pith:C27V4Y2K","schema_version":"1.0","canonical_sha256":"16bf5e634acee63ebd66466a322afa51f099a2526ab1d47634641121037eaf1e","source":{"kind":"arxiv","id":"1703.10500","version":2},"attestation_state":"computed","paper":{"title":"Free Energy Approximations for CSMA networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Benny Van Houdt","submitted_at":"2017-03-30T14:51:13Z","abstract_excerpt":"In this paper we study how to estimate the back-off rates in an idealized CSMA network consisting of $n$ links to achieve a given throughput vector using free energy approximations. More specifically, we introduce the class of region-based free energy approximations with clique belief and present a closed form expression for the back-off rates based on the zero gradient points of the free energy approximation (in terms of the conflict graph, target throughput vector and counting numbers). Next we introduce the size $k_{max}$ clique free energy approximation as a special case and derive an expl"},"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":"1703.10500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-03-30T14:51:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3372486f12d80a33135a56218d5d679bd8209dd626973296b659a96085af8fa1","abstract_canon_sha256":"610eddd755394cf9f5c45892ab73127347a9e570d74888331f17d2dd0838cc9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:46.109213Z","signature_b64":"MK8VwqRTG16IXJGaHObFwQynJ+O+jIrkD34XcWeReIyf+3oVdlYh5MwDSssaK/6lVidvjT6e9uQPXvxufJ1jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16bf5e634acee63ebd66466a322afa51f099a2526ab1d47634641121037eaf1e","last_reissued_at":"2026-05-18T00:46:46.108385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:46.108385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Free Energy Approximations for CSMA networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Benny Van Houdt","submitted_at":"2017-03-30T14:51:13Z","abstract_excerpt":"In this paper we study how to estimate the back-off rates in an idealized CSMA network consisting of $n$ links to achieve a given throughput vector using free energy approximations. More specifically, we introduce the class of region-based free energy approximations with clique belief and present a closed form expression for the back-off rates based on the zero gradient points of the free energy approximation (in terms of the conflict graph, target throughput vector and counting numbers). Next we introduce the size $k_{max}$ clique free energy approximation as a special case and derive an expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10500","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":"1703.10500","created_at":"2026-05-18T00:46:46.108526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10500v2","created_at":"2026-05-18T00:46:46.108526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10500","created_at":"2026-05-18T00:46:46.108526+00:00"},{"alias_kind":"pith_short_12","alias_value":"C27V4Y2KZ3TD","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C27V4Y2KZ3TD5PLG","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C27V4Y2K","created_at":"2026-05-18T12:31:08.081275+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/C27V4Y2KZ3TD5PLGIZVDEKX2KH","json":"https://pith.science/pith/C27V4Y2KZ3TD5PLGIZVDEKX2KH.json","graph_json":"https://pith.science/api/pith-number/C27V4Y2KZ3TD5PLGIZVDEKX2KH/graph.json","events_json":"https://pith.science/api/pith-number/C27V4Y2KZ3TD5PLGIZVDEKX2KH/events.json","paper":"https://pith.science/paper/C27V4Y2K"},"agent_actions":{"view_html":"https://pith.science/pith/C27V4Y2KZ3TD5PLGIZVDEKX2KH","download_json":"https://pith.science/pith/C27V4Y2KZ3TD5PLGIZVDEKX2KH.json","view_paper":"https://pith.science/paper/C27V4Y2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10500&json=true","fetch_graph":"https://pith.science/api/pith-number/C27V4Y2KZ3TD5PLGIZVDEKX2KH/graph.json","fetch_events":"https://pith.science/api/pith-number/C27V4Y2KZ3TD5PLGIZVDEKX2KH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C27V4Y2KZ3TD5PLGIZVDEKX2KH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C27V4Y2KZ3TD5PLGIZVDEKX2KH/action/storage_attestation","attest_author":"https://pith.science/pith/C27V4Y2KZ3TD5PLGIZVDEKX2KH/action/author_attestation","sign_citation":"https://pith.science/pith/C27V4Y2KZ3TD5PLGIZVDEKX2KH/action/citation_signature","submit_replication":"https://pith.science/pith/C27V4Y2KZ3TD5PLGIZVDEKX2KH/action/replication_record"}},"created_at":"2026-05-18T00:46:46.108526+00:00","updated_at":"2026-05-18T00:46:46.108526+00:00"}