{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BNZXZ6E6XCLAYLIFIQC4D7RGRW","short_pith_number":"pith:BNZXZ6E6","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"},"canonical_sha256":"0b737cf89eb8960c2d054405c1fe268db4ca0f5a5106470c4b34a26dc01b96c4","source":{"kind":"arxiv","id":"1204.3569","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3569","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3569v2","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3569","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"BNZXZ6E6XCLA","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"pith_short_16","alias_value":"BNZXZ6E6XCLAYLIF","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"pith_short_8","alias_value":"BNZXZ6E6","created_at":"2026-07-05T08:46:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BNZXZ6E6XCLAYLIFIQC4D7RGRW","target":"record","payload":{"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"},"canonical_sha256":"0b737cf89eb8960c2d054405c1fe268db4ca0f5a5106470c4b34a26dc01b96c4","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"},"source_kind":"arxiv","source_id":"1204.3569","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-07-05T08:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fp6bqsNKYgr8wz+VOZ/HjaP06f/8fuvjeDN/JNe6MpFtT7jNTaYwYSc1Gb/Y25DD1FqkwGdf/hma/GMcx74Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T02:50:17.619328Z"},"content_sha256":"5a8a96616d49c713cf9fafe98c57b72e485ebdbfda0a0fe94e4401988db4f9e4","schema_version":"1.0","event_id":"sha256:5a8a96616d49c713cf9fafe98c57b72e485ebdbfda0a0fe94e4401988db4f9e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BNZXZ6E6XCLAYLIFIQC4D7RGRW","target":"graph","payload":{"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"},"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-07-05T08:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53mbK1fpr31dwjYT/wYZVT6l5lD6D1acZDzUp1MmYpzS7fepyRHsfReyKqhHoOkogXN4mM83u9pphoTfnaLsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T02:50:17.619702Z"},"content_sha256":"f582d58ecf5d105786a05d8f7cda1cd81376fa131d17aa50d7e924e5b54da753","schema_version":"1.0","event_id":"sha256:f582d58ecf5d105786a05d8f7cda1cd81376fa131d17aa50d7e924e5b54da753"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/bundle.json","state_url":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/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-07-17T02:50:17Z","links":{"resolver":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW","bundle":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/bundle.json","state":"https://pith.science/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNZXZ6E6XCLAYLIFIQC4D7RGRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BNZXZ6E6XCLAYLIFIQC4D7RGRW","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":"93f627e030ab03b5fd7ee96949f09370e8637205162d289e0420799f7a38e5ef","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-16T16:55:50Z","title_canon_sha256":"d54e89bb7d365cf88091883db28f9fd934c68928c5fe7a58b50c8ebe13b20dc6"},"schema_version":"1.0","source":{"id":"1204.3569","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3569","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3569v2","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3569","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"BNZXZ6E6XCLA","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"pith_short_16","alias_value":"BNZXZ6E6XCLAYLIF","created_at":"2026-07-05T08:46:04Z"},{"alias_kind":"pith_short_8","alias_value":"BNZXZ6E6","created_at":"2026-07-05T08:46:04Z"}],"graph_snapshots":[{"event_id":"sha256:f582d58ecf5d105786a05d8f7cda1cd81376fa131d17aa50d7e924e5b54da753","target":"graph","created_at":"2026-07-05T08:46:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1204.3569/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Federico Librino, Marco Levorato, Michele Zorzi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-16T16:55:50Z","title":"An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3569","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:5a8a96616d49c713cf9fafe98c57b72e485ebdbfda0a0fe94e4401988db4f9e4","target":"record","created_at":"2026-07-05T08:46:04Z","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":"93f627e030ab03b5fd7ee96949f09370e8637205162d289e0420799f7a38e5ef","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-16T16:55:50Z","title_canon_sha256":"d54e89bb7d365cf88091883db28f9fd934c68928c5fe7a58b50c8ebe13b20dc6"},"schema_version":"1.0","source":{"id":"1204.3569","kind":"arxiv","version":2}},"canonical_sha256":"0b737cf89eb8960c2d054405c1fe268db4ca0f5a5106470c4b34a26dc01b96c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b737cf89eb8960c2d054405c1fe268db4ca0f5a5106470c4b34a26dc01b96c4","first_computed_at":"2026-07-05T08:46:04.545297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:46:04.545297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W9WcIzsmu6PSMpjWkxasQXfgdBGogsEx+zFY4y50hRpb/+QHAAXNvEtpcbSX0eJ06MFD3lF2l+gWZ6gXBhavAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:46:04.545902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3569","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a8a96616d49c713cf9fafe98c57b72e485ebdbfda0a0fe94e4401988db4f9e4","sha256:f582d58ecf5d105786a05d8f7cda1cd81376fa131d17aa50d7e924e5b54da753"],"state_sha256":"9a357da49910db15741fabee822c0e97375ae371efd86549dfce38539a889750"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuO5D1tOY8RLusYAjgFpOGMrQnTYN/sNDm3hrHsMda3VRh6hcHZGrFhB0zpNK01RpGtVeya8ho3tgmyIvXgJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T02:50:17.621781Z","bundle_sha256":"b7be1a41a46a9e09e74ca6c59de41515b4c07381887aa057003cb9fc9d07e1d0"}}