{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:B6MH2HYCCHEAWMNPRITCTL5WHO","short_pith_number":"pith:B6MH2HYC","schema_version":"1.0","canonical_sha256":"0f987d1f0211c80b31af8a2629afb63ba021193ae287c6d227b6edfa5cd86605","source":{"kind":"arxiv","id":"1110.5657","version":3},"attestation_state":"computed","paper":{"title":"Computing links and accessing arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.GN"],"primary_cat":"math.LO","authors_text":"Timothy H. McNicholl","submitted_at":"2011-10-25T20:32:11Z","abstract_excerpt":"Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is also demonstrated."},"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":"1110.5657","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-10-25T20:32:11Z","cross_cats_sorted":["cs.CG","math.GN"],"title_canon_sha256":"bf67c82a66dd1d8ad3d4222a94bc45e9237ef7055eef4dc263ccea8453af8ee4","abstract_canon_sha256":"a961b7c66a3b35ac104141481e9879676ae63f77ab6060eb171fbd0c35254f03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:29.161590Z","signature_b64":"jBiF5DxrVR5CuLAA5n7DbQgsd6FHxb2qvCeRklr3VXJTn8xSXPtYx9wLKAi1HNVSCR6KSWXYTQ+MN5CTQWIiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f987d1f0211c80b31af8a2629afb63ba021193ae287c6d227b6edfa5cd86605","last_reissued_at":"2026-05-18T03:39:29.160904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:29.160904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing links and accessing arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.GN"],"primary_cat":"math.LO","authors_text":"Timothy H. McNicholl","submitted_at":"2011-10-25T20:32:11Z","abstract_excerpt":"Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is also demonstrated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5657","kind":"arxiv","version":3},"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":"1110.5657","created_at":"2026-05-18T03:39:29.161008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5657v3","created_at":"2026-05-18T03:39:29.161008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5657","created_at":"2026-05-18T03:39:29.161008+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6MH2HYCCHEA","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6MH2HYCCHEAWMNP","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6MH2HYC","created_at":"2026-05-18T12:26:24.575870+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/B6MH2HYCCHEAWMNPRITCTL5WHO","json":"https://pith.science/pith/B6MH2HYCCHEAWMNPRITCTL5WHO.json","graph_json":"https://pith.science/api/pith-number/B6MH2HYCCHEAWMNPRITCTL5WHO/graph.json","events_json":"https://pith.science/api/pith-number/B6MH2HYCCHEAWMNPRITCTL5WHO/events.json","paper":"https://pith.science/paper/B6MH2HYC"},"agent_actions":{"view_html":"https://pith.science/pith/B6MH2HYCCHEAWMNPRITCTL5WHO","download_json":"https://pith.science/pith/B6MH2HYCCHEAWMNPRITCTL5WHO.json","view_paper":"https://pith.science/paper/B6MH2HYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5657&json=true","fetch_graph":"https://pith.science/api/pith-number/B6MH2HYCCHEAWMNPRITCTL5WHO/graph.json","fetch_events":"https://pith.science/api/pith-number/B6MH2HYCCHEAWMNPRITCTL5WHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6MH2HYCCHEAWMNPRITCTL5WHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6MH2HYCCHEAWMNPRITCTL5WHO/action/storage_attestation","attest_author":"https://pith.science/pith/B6MH2HYCCHEAWMNPRITCTL5WHO/action/author_attestation","sign_citation":"https://pith.science/pith/B6MH2HYCCHEAWMNPRITCTL5WHO/action/citation_signature","submit_replication":"https://pith.science/pith/B6MH2HYCCHEAWMNPRITCTL5WHO/action/replication_record"}},"created_at":"2026-05-18T03:39:29.161008+00:00","updated_at":"2026-05-18T03:39:29.161008+00:00"}