{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FO7GBFUMUULPL56Z2JHE573NVX","short_pith_number":"pith:FO7GBFUM","canonical_record":{"source":{"id":"2503.21711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-27T17:22:14Z","cross_cats_sorted":[],"title_canon_sha256":"84e2fe62d61ea5fc0de226bedcac5c171b815242e674947f6dabe3e36c471fe4","abstract_canon_sha256":"d5eff7b79a9165154dc295bbb530100c5eb05312abf884befa2dbcd99b534d81"},"schema_version":"1.0"},"canonical_sha256":"2bbe60968ca516f5f7d9d24e4eff6daddfb46fb43231b5d78053ee041b851733","source":{"kind":"arxiv","id":"2503.21711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.21711","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"2503.21711v1","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21711","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"FO7GBFUMUULP","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"pith_short_16","alias_value":"FO7GBFUMUULPL56Z","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"pith_short_8","alias_value":"FO7GBFUM","created_at":"2026-07-05T10:40:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FO7GBFUMUULPL56Z2JHE573NVX","target":"record","payload":{"canonical_record":{"source":{"id":"2503.21711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-27T17:22:14Z","cross_cats_sorted":[],"title_canon_sha256":"84e2fe62d61ea5fc0de226bedcac5c171b815242e674947f6dabe3e36c471fe4","abstract_canon_sha256":"d5eff7b79a9165154dc295bbb530100c5eb05312abf884befa2dbcd99b534d81"},"schema_version":"1.0"},"canonical_sha256":"2bbe60968ca516f5f7d9d24e4eff6daddfb46fb43231b5d78053ee041b851733","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:40:29.284214Z","signature_b64":"SEuivCX5sBmQOkMNFcLqVSN70adpG0040JDuWe+Qz9K77Pb8+ioUC4ZgDMjh4XI4vLpzEZR7mMBMe5cZJh6DCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bbe60968ca516f5f7d9d24e4eff6daddfb46fb43231b5d78053ee041b851733","last_reissued_at":"2026-07-05T10:40:29.283636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:40:29.283636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.21711","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-07-05T10:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7S8UJBmGqgMeHzZg0tIMh077lszTE4K/E2d5O6e/eprS9wsh7h5aC9EM8CWD9Lo+QiZd8HozuzCvhGO1t3OAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:17:14.671165Z"},"content_sha256":"e8d3d05f2179acd26732f65df6a724d942fddb9529eb08de7db3cfa66464b8e2","schema_version":"1.0","event_id":"sha256:e8d3d05f2179acd26732f65df6a724d942fddb9529eb08de7db3cfa66464b8e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FO7GBFUMUULPL56Z2JHE573NVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Computation of the Directional Extremal Boundary of a Union of Equal-Radius Circles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Gribov","submitted_at":"2025-03-27T17:22:14Z","abstract_excerpt":"This paper focuses on computing the directional extremal boundary of a union of equal-radius circles. We introduce an efficient algorithm that accurately determines this boundary by analyzing the intersections and dominant relationships among the circles. The algorithm has time complexity of O(n log n)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21711","kind":"arxiv","version":1},"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/2503.21711/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-05T10:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHn+3jEPP26ic1ANOZu2q27Poaxb3xN8zOTFCZHZsX6k2DIr3LegA5QI0nk/fusS+W+P4ivraSDKxuNYVEGKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:17:14.671673Z"},"content_sha256":"3245866b95d76ffcabdaac7ec26e311213107dbd506993f17592cea8b400f14a","schema_version":"1.0","event_id":"sha256:3245866b95d76ffcabdaac7ec26e311213107dbd506993f17592cea8b400f14a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FO7GBFUMUULPL56Z2JHE573NVX/bundle.json","state_url":"https://pith.science/pith/FO7GBFUMUULPL56Z2JHE573NVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FO7GBFUMUULPL56Z2JHE573NVX/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-08-06T08:17:14Z","links":{"resolver":"https://pith.science/pith/FO7GBFUMUULPL56Z2JHE573NVX","bundle":"https://pith.science/pith/FO7GBFUMUULPL56Z2JHE573NVX/bundle.json","state":"https://pith.science/pith/FO7GBFUMUULPL56Z2JHE573NVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FO7GBFUMUULPL56Z2JHE573NVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FO7GBFUMUULPL56Z2JHE573NVX","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":"d5eff7b79a9165154dc295bbb530100c5eb05312abf884befa2dbcd99b534d81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-27T17:22:14Z","title_canon_sha256":"84e2fe62d61ea5fc0de226bedcac5c171b815242e674947f6dabe3e36c471fe4"},"schema_version":"1.0","source":{"id":"2503.21711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.21711","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"2503.21711v1","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21711","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"FO7GBFUMUULP","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"pith_short_16","alias_value":"FO7GBFUMUULPL56Z","created_at":"2026-07-05T10:40:29Z"},{"alias_kind":"pith_short_8","alias_value":"FO7GBFUM","created_at":"2026-07-05T10:40:29Z"}],"graph_snapshots":[{"event_id":"sha256:3245866b95d76ffcabdaac7ec26e311213107dbd506993f17592cea8b400f14a","target":"graph","created_at":"2026-07-05T10:40:29Z","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/2503.21711/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper focuses on computing the directional extremal boundary of a union of equal-radius circles. We introduce an efficient algorithm that accurately determines this boundary by analyzing the intersections and dominant relationships among the circles. The algorithm has time complexity of O(n log n).","authors_text":"Alexander Gribov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-27T17:22:14Z","title":"Efficient Computation of the Directional Extremal Boundary of a Union of Equal-Radius Circles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21711","kind":"arxiv","version":1},"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:e8d3d05f2179acd26732f65df6a724d942fddb9529eb08de7db3cfa66464b8e2","target":"record","created_at":"2026-07-05T10:40:29Z","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":"d5eff7b79a9165154dc295bbb530100c5eb05312abf884befa2dbcd99b534d81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-27T17:22:14Z","title_canon_sha256":"84e2fe62d61ea5fc0de226bedcac5c171b815242e674947f6dabe3e36c471fe4"},"schema_version":"1.0","source":{"id":"2503.21711","kind":"arxiv","version":1}},"canonical_sha256":"2bbe60968ca516f5f7d9d24e4eff6daddfb46fb43231b5d78053ee041b851733","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bbe60968ca516f5f7d9d24e4eff6daddfb46fb43231b5d78053ee041b851733","first_computed_at":"2026-07-05T10:40:29.283636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:40:29.283636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SEuivCX5sBmQOkMNFcLqVSN70adpG0040JDuWe+Qz9K77Pb8+ioUC4ZgDMjh4XI4vLpzEZR7mMBMe5cZJh6DCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:40:29.284214Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.21711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8d3d05f2179acd26732f65df6a724d942fddb9529eb08de7db3cfa66464b8e2","sha256:3245866b95d76ffcabdaac7ec26e311213107dbd506993f17592cea8b400f14a"],"state_sha256":"8dabe7df7b6958f5da0652137fba9fb96438789cc8e9810bcb86edc263fb4ae0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEbB8GbG8pw6Kl1up8+XTIr6fSji60ViWtcHJV7sW8cuSIsXwCvzafvtcPxIfwk3ZcnX3NMfNtr+wpXlo2RfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:17:14.677405Z","bundle_sha256":"26cc5594adf9d51b9eabaa914b4de29c27a9bd129e8c141fed2f9b31df49a84c"}}