{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BNZXZ6E6XCLAYLIFIQC4D7RGRW","short_pith_number":"pith:BNZXZ6E6","schema_version":"1.0","canonical_sha256":"0b737cf89eb8960c2d054405c1fe268db4ca0f5a5106470c4b34a26dc01b96c4","source":{"kind":"arxiv","id":"1204.3569","version":2},"attestation_state":"computed","paper":{"title":"An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Federico Librino, Marco Levorato, Michele Zorzi","submitted_at":"2012-04-16T16:55:50Z","abstract_excerpt":"A novel iterative algorithm for the efficient computation of the intersection areas of an arbitrary number of circles is presented. The algorithm, based on a trellis-structure, hinges on two geometric results which allow the existence-check and the computation of the area of the intersection regions generated by more than three circles by simple algebraic manipulations of the intersection areas of a smaller number of circles. The presented algorithm is a powerful tool for the performance analysis of wireless networks, and finds many applications, ranging from sensor to cellular networks. As an"},"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":"1204.3569","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-16T16:55:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d54e89bb7d365cf88091883db28f9fd934c68928c5fe7a58b50c8ebe13b20dc6","abstract_canon_sha256":"93f627e030ab03b5fd7ee96949f09370e8637205162d289e0420799f7a38e5ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:04.545902Z","signature_b64":"W9WcIzsmu6PSMpjWkxasQXfgdBGogsEx+zFY4y50hRpb/+QHAAXNvEtpcbSX0eJ06MFD3lF2l+gWZ6gXBhavAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b737cf89eb8960c2d054405c1fe268db4ca0f5a5106470c4b34a26dc01b96c4","last_reissued_at":"2026-07-05T08:46:04.545297Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:04.545297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Federico Librino, Marco Levorato, Michele Zorzi","submitted_at":"2012-04-16T16:55:50Z","abstract_excerpt":"A novel iterative algorithm for the efficient computation of the intersection areas of an arbitrary number of circles is presented. The algorithm, based on a trellis-structure, hinges on two geometric results which allow the existence-check and the computation of the area of the intersection regions generated by more than three circles by simple algebraic manipulations of the intersection areas of a smaller number of circles. The presented algorithm is a powerful tool for the performance analysis of wireless networks, and finds many applications, ranging from sensor to cellular networks. As an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3569","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1204.3569/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1204.3569","created_at":"2026-07-05T08:46:04.545397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3569v2","created_at":"2026-07-05T08:46:04.545397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3569","created_at":"2026-07-05T08:46:04.545397+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNZXZ6E6XCLA","created_at":"2026-07-05T08:46:04.545397+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNZXZ6E6XCLAYLIF","created_at":"2026-07-05T08:46:04.545397+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNZXZ6E6","created_at":"2026-07-05T08:46:04.545397+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/BNZXZ6E6XCLAYLIFIQC4D7RGRW","json":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW.json","graph_json":"https://pith.science/api/pith-number/BNZXZ6E6XCLAYLIFIQC4D7RGRW/graph.json","events_json":"https://pith.science/api/pith-number/BNZXZ6E6XCLAYLIFIQC4D7RGRW/events.json","paper":"https://pith.science/paper/BNZXZ6E6"},"agent_actions":{"view_html":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW","download_json":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW.json","view_paper":"https://pith.science/paper/BNZXZ6E6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3569&json=true","fetch_graph":"https://pith.science/api/pith-number/BNZXZ6E6XCLAYLIFIQC4D7RGRW/graph.json","fetch_events":"https://pith.science/api/pith-number/BNZXZ6E6XCLAYLIFIQC4D7RGRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/action/storage_attestation","attest_author":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/action/author_attestation","sign_citation":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/action/citation_signature","submit_replication":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/action/replication_record"}},"created_at":"2026-07-05T08:46:04.545397+00:00","updated_at":"2026-07-05T08:46:04.545397+00:00"}