{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CY3VJPLHPERMKPEJG5NZLAOVH3","short_pith_number":"pith:CY3VJPLH","canonical_record":{"source":{"id":"2605.15627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T05:20:17Z","cross_cats_sorted":[],"title_canon_sha256":"f3780ffd7eb351741bf130f109bce3a179bde8a4fe6fce0bd16854cdf066d1db","abstract_canon_sha256":"587b8de304853e6d366ce5d882927d34e2c93fb7fb7368ce9f44d88e1b8ee5f3"},"schema_version":"1.0"},"canonical_sha256":"163754bd677922c53c89375b9581d53eeb98c76ebf411f4f077546518e89a363","source":{"kind":"arxiv","id":"2605.15627","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15627","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15627v1","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15627","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"CY3VJPLHPERM","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_16","alias_value":"CY3VJPLHPERMKPEJ","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_8","alias_value":"CY3VJPLH","created_at":"2026-05-20T00:01:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CY3VJPLHPERMKPEJG5NZLAOVH3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T05:20:17Z","cross_cats_sorted":[],"title_canon_sha256":"f3780ffd7eb351741bf130f109bce3a179bde8a4fe6fce0bd16854cdf066d1db","abstract_canon_sha256":"587b8de304853e6d366ce5d882927d34e2c93fb7fb7368ce9f44d88e1b8ee5f3"},"schema_version":"1.0"},"canonical_sha256":"163754bd677922c53c89375b9581d53eeb98c76ebf411f4f077546518e89a363","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:08.864688Z","signature_b64":"+iE6YXA+FJMQZQPfidkDt43dyrfFc3+fK+LDlXXSl8WTLq2wFrQAA/NJ+UqZg0aEWBmZVcyT9Z3pniPJ8yl/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"163754bd677922c53c89375b9581d53eeb98c76ebf411f4f077546518e89a363","last_reissued_at":"2026-05-20T00:01:08.863803Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:08.863803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15627","source_version":1,"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-20T00:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNCFG9iwsVJI+qmFgVYv77oQsZWgE/52StW2eANR8308JQ3HRWfXa1N7xSDh0cadGvK9ClJm3GHLsrsfZrhwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:33.766583Z"},"content_sha256":"4e47c20a9c93fbf4454efb362cff747a5ab34ea5f73994a94eb83064c60fd60f","schema_version":"1.0","event_id":"sha256:4e47c20a9c93fbf4454efb362cff747a5ab34ea5f73994a94eb83064c60fd60f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CY3VJPLHPERMKPEJG5NZLAOVH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An adaptive quadtree algorithm approximates circle-polygon intersection areas in O(1/ε^{3/2}) time with O(ε) error.","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Baoshan Wang, Lan Li, Songyi Liu, Yongjun Wang, Zeping Yi","submitted_at":"2026-05-15T05:20:17Z","abstract_excerpt":"In this paper, we present an improved numerical algorithm for computing the intersection area of multiple circles and a complex polygon efficiently. This geometric problem is fundamental to applications such as wireless sensor networks and base station deployment. The key idea is a curvature-multiplicity-guided adaptive sampling strategy that dynamically concentrates sampling points in geometrically complex boundary regions. The algorithm integrates three components: (i) adaptive quadtree partitioning, (ii) analytical integration via Green's theorem for cells intersecting a single circle, and "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Theoretical analysis shows that the algorithm achieves O(1/ε^{3/2}) computational complexity while maintaining an O(ε) error bound, improving upon the O(1/ε²) complexity of classical Monte Carlo and uniform grid methods for the same error tolerance ε.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The curvature-multiplicity-guided adaptive sampling strategy, including the introduced minimum sample count and constant factor, correctly concentrates points on complex boundaries to achieve the stated O(ε) error without systematic bias or missed intersections in multi-circle cells.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An adaptive quadtree algorithm with curvature-guided Monte Carlo sampling for multi-circle polygon intersections achieves O(1/ε^{3/2}) complexity at O(ε) error, outperforming classical methods in experiments.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An adaptive quadtree algorithm approximates circle-polygon intersection areas in O(1/ε^{3/2}) time with O(ε) error.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"56d4d4f99f1c285b2d04e96f54b0106b7f077a698cd1fe02ff1911701f0d26bf"},"source":{"id":"2605.15627","kind":"arxiv","version":1},"verdict":{"id":"1b2a4586-8c96-4872-a73e-14c387243148","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:28:25.298984Z","strongest_claim":"Theoretical analysis shows that the algorithm achieves O(1/ε^{3/2}) computational complexity while maintaining an O(ε) error bound, improving upon the O(1/ε²) complexity of classical Monte Carlo and uniform grid methods for the same error tolerance ε.","one_line_summary":"An adaptive quadtree algorithm with curvature-guided Monte Carlo sampling for multi-circle polygon intersections achieves O(1/ε^{3/2}) complexity at O(ε) error, outperforming classical methods in experiments.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The curvature-multiplicity-guided adaptive sampling strategy, including the introduced minimum sample count and constant factor, correctly concentrates points on complex boundaries to achieve the stated O(ε) error without systematic bias or missed intersections in multi-circle cells.","pith_extraction_headline":"An adaptive quadtree algorithm approximates circle-polygon intersection areas in O(1/ε^{3/2}) time with O(ε) error."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15627/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:34.608615Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:19.024067Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:41:27.370009Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:41:56.030894Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8a3a85c4f2a1243beb63de941ad41afabe058108788456e9055a1396462aab3e"},"references":{"count":35,"sample":[{"doi":"","year":2019,"title":"A. P. de Almeida Rocha, A. Rodler, R. C. Oliveira, J. Virgone, N. Mendes, A pixel counting technique for sun patch assessment within building enclosures, Solar Energy 184 (2019) 173–","work_id":"b1e9e004-3d4b-49be-97c3-91be28a7970e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.solener.2019.03.081","year":2019,"title":"doi:https://doi.org/10.1016/j.solener.2019.03.081","work_id":"d6434236-6e2d-4f58-8adb-9b458e2b226d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"M. S. Shaikh, C. Wang, S. Xie, G. Zheng, X. Dong, S. Qiu, M. A. Ahmad, S. Raj, Cover- age and connectivity maximization for wireless sensor networks using improved chaotic grey wolf optimization, Scie","work_id":"f40ec45a-4a74-49e0-b642-ee2fa33e1acc","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1038/s41598-025-20978-8","year":2025,"title":"W. Wu, Z. Wang, L. Lin, X. Chang, L. Tian, An efficient coverage path planning method for UA V in complex concave regions, Scientific Reports 15 (2025) 37227. doi:https://doi. org/10.1038/s41598-025-2","work_id":"0ce1ce95-35d1-4f3f-a5d9-9776f40a80a9","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Bogosel, V olume computation for meissner polyhedra and applications, Dis- crete & Computational Geometry 75 (2026) 48–72","work_id":"f4a3c6d6-75ec-43c6-8d3d-688f1cb02ed5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":35,"snapshot_sha256":"fc25b2c5c3a2191e61e9bbd9424633f1597e15feb7fb08918f5b6d4c3e894582","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4b4550bdfe0ae9b98d86440f05fc0050f8349c2d5a983a55e35982475cc7813f"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"1b2a4586-8c96-4872-a73e-14c387243148"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BIQAUfWZRHWlBF14dtC6hgOqlvM/CzSDuLO0BfuMdzfiE70HslMRunVEAXF+hd6nP9N8wFw5N0cYP5ZX6ODAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:35:33.767912Z"},"content_sha256":"ed8ae8f2eb239e2dd7bfeba9ed986ccca3dd93060cb0c298ea0a03e784108a7c","schema_version":"1.0","event_id":"sha256:ed8ae8f2eb239e2dd7bfeba9ed986ccca3dd93060cb0c298ea0a03e784108a7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CY3VJPLHPERMKPEJG5NZLAOVH3/bundle.json","state_url":"https://pith.science/pith/CY3VJPLHPERMKPEJG5NZLAOVH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CY3VJPLHPERMKPEJG5NZLAOVH3/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-27T16:35:33Z","links":{"resolver":"https://pith.science/pith/CY3VJPLHPERMKPEJG5NZLAOVH3","bundle":"https://pith.science/pith/CY3VJPLHPERMKPEJG5NZLAOVH3/bundle.json","state":"https://pith.science/pith/CY3VJPLHPERMKPEJG5NZLAOVH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CY3VJPLHPERMKPEJG5NZLAOVH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CY3VJPLHPERMKPEJG5NZLAOVH3","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":"587b8de304853e6d366ce5d882927d34e2c93fb7fb7368ce9f44d88e1b8ee5f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T05:20:17Z","title_canon_sha256":"f3780ffd7eb351741bf130f109bce3a179bde8a4fe6fce0bd16854cdf066d1db"},"schema_version":"1.0","source":{"id":"2605.15627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15627","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15627v1","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15627","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_12","alias_value":"CY3VJPLHPERM","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_16","alias_value":"CY3VJPLHPERMKPEJ","created_at":"2026-05-20T00:01:08Z"},{"alias_kind":"pith_short_8","alias_value":"CY3VJPLH","created_at":"2026-05-20T00:01:08Z"}],"graph_snapshots":[{"event_id":"sha256:ed8ae8f2eb239e2dd7bfeba9ed986ccca3dd93060cb0c298ea0a03e784108a7c","target":"graph","created_at":"2026-05-20T00:01:08Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Theoretical analysis shows that the algorithm achieves O(1/ε^{3/2}) computational complexity while maintaining an O(ε) error bound, improving upon the O(1/ε²) complexity of classical Monte Carlo and uniform grid methods for the same error tolerance ε."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The curvature-multiplicity-guided adaptive sampling strategy, including the introduced minimum sample count and constant factor, correctly concentrates points on complex boundaries to achieve the stated O(ε) error without systematic bias or missed intersections in multi-circle cells."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An adaptive quadtree algorithm with curvature-guided Monte Carlo sampling for multi-circle polygon intersections achieves O(1/ε^{3/2}) complexity at O(ε) error, outperforming classical methods in experiments."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An adaptive quadtree algorithm approximates circle-polygon intersection areas in O(1/ε^{3/2}) time with O(ε) error."}],"snapshot_sha256":"56d4d4f99f1c285b2d04e96f54b0106b7f077a698cd1fe02ff1911701f0d26bf"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4b4550bdfe0ae9b98d86440f05fc0050f8349c2d5a983a55e35982475cc7813f"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:34.608615Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:19.024067Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:41:27.370009Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:41:56.030894Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15627/integrity.json","findings":[],"snapshot_sha256":"8a3a85c4f2a1243beb63de941ad41afabe058108788456e9055a1396462aab3e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present an improved numerical algorithm for computing the intersection area of multiple circles and a complex polygon efficiently. This geometric problem is fundamental to applications such as wireless sensor networks and base station deployment. The key idea is a curvature-multiplicity-guided adaptive sampling strategy that dynamically concentrates sampling points in geometrically complex boundary regions. The algorithm integrates three components: (i) adaptive quadtree partitioning, (ii) analytical integration via Green's theorem for cells intersecting a single circle, and ","authors_text":"Baoshan Wang, Lan Li, Songyi Liu, Yongjun Wang, Zeping Yi","cross_cats":[],"headline":"An adaptive quadtree algorithm approximates circle-polygon intersection areas in O(1/ε^{3/2}) time with O(ε) error.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T05:20:17Z","title":"An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation"},"references":{"count":35,"internal_anchors":0,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A. P. de Almeida Rocha, A. Rodler, R. C. Oliveira, J. Virgone, N. Mendes, A pixel counting technique for sun patch assessment within building enclosures, Solar Energy 184 (2019) 173–","work_id":"b1e9e004-3d4b-49be-97c3-91be28a7970e","year":2019},{"cited_arxiv_id":"","doi":"10.1016/j.solener.2019.03.081","is_internal_anchor":false,"ref_index":2,"title":"doi:https://doi.org/10.1016/j.solener.2019.03.081","work_id":"d6434236-6e2d-4f58-8adb-9b458e2b226d","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"M. S. Shaikh, C. Wang, S. Xie, G. Zheng, X. Dong, S. Qiu, M. A. Ahmad, S. Raj, Cover- age and connectivity maximization for wireless sensor networks using improved chaotic grey wolf optimization, Scie","work_id":"f40ec45a-4a74-49e0-b642-ee2fa33e1acc","year":2025},{"cited_arxiv_id":"","doi":"10.1038/s41598-025-20978-8","is_internal_anchor":false,"ref_index":4,"title":"W. Wu, Z. Wang, L. Lin, X. Chang, L. Tian, An efficient coverage path planning method for UA V in complex concave regions, Scientific Reports 15 (2025) 37227. doi:https://doi. org/10.1038/s41598-025-2","work_id":"0ce1ce95-35d1-4f3f-a5d9-9776f40a80a9","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Bogosel, V olume computation for meissner polyhedra and applications, Dis- crete & Computational Geometry 75 (2026) 48–72","work_id":"f4a3c6d6-75ec-43c6-8d3d-688f1cb02ed5","year":2026}],"snapshot_sha256":"fc25b2c5c3a2191e61e9bbd9424633f1597e15feb7fb08918f5b6d4c3e894582"},"source":{"id":"2605.15627","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:28:25.298984Z","id":"1b2a4586-8c96-4872-a73e-14c387243148","model_set":{"reader":"grok-4.3"},"one_line_summary":"An adaptive quadtree algorithm with curvature-guided Monte Carlo sampling for multi-circle polygon intersections achieves O(1/ε^{3/2}) complexity at O(ε) error, outperforming classical methods in experiments.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An adaptive quadtree algorithm approximates circle-polygon intersection areas in O(1/ε^{3/2}) time with O(ε) error.","strongest_claim":"Theoretical analysis shows that the algorithm achieves O(1/ε^{3/2}) computational complexity while maintaining an O(ε) error bound, improving upon the O(1/ε²) complexity of classical Monte Carlo and uniform grid methods for the same error tolerance ε.","weakest_assumption":"The curvature-multiplicity-guided adaptive sampling strategy, including the introduced minimum sample count and constant factor, correctly concentrates points on complex boundaries to achieve the stated O(ε) error without systematic bias or missed intersections in multi-circle cells."}},"verdict_id":"1b2a4586-8c96-4872-a73e-14c387243148"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4e47c20a9c93fbf4454efb362cff747a5ab34ea5f73994a94eb83064c60fd60f","target":"record","created_at":"2026-05-20T00:01:08Z","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":"587b8de304853e6d366ce5d882927d34e2c93fb7fb7368ce9f44d88e1b8ee5f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-15T05:20:17Z","title_canon_sha256":"f3780ffd7eb351741bf130f109bce3a179bde8a4fe6fce0bd16854cdf066d1db"},"schema_version":"1.0","source":{"id":"2605.15627","kind":"arxiv","version":1}},"canonical_sha256":"163754bd677922c53c89375b9581d53eeb98c76ebf411f4f077546518e89a363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"163754bd677922c53c89375b9581d53eeb98c76ebf411f4f077546518e89a363","first_computed_at":"2026-05-20T00:01:08.863803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:08.863803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+iE6YXA+FJMQZQPfidkDt43dyrfFc3+fK+LDlXXSl8WTLq2wFrQAA/NJ+UqZg0aEWBmZVcyT9Z3pniPJ8yl/Dg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:08.864688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e47c20a9c93fbf4454efb362cff747a5ab34ea5f73994a94eb83064c60fd60f","sha256:ed8ae8f2eb239e2dd7bfeba9ed986ccca3dd93060cb0c298ea0a03e784108a7c"],"state_sha256":"48e2594dc5b4329e546df37bd2db49db2287629762bdb56a65a7008d67152914"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJP6uutxzv1w6DazIwG8dUYCmGhOHrVFVUOzIlUjFEYDfk2vfM9507prd7biKcdkRlAnVw8xpIW3fM9o1yNVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:35:33.772613Z","bundle_sha256":"0fd8391f1a377295ffb5d05d5e7e28ffbfdd2b58f0efe18679467c41ed6d015a"}}