{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SZFJ4NM6YGGEVJKTNT76MR377F","short_pith_number":"pith:SZFJ4NM6","schema_version":"1.0","canonical_sha256":"964a9e359ec18c4aa5536cffe6477ff979be34b3fb5592c059ed1c5201f86c3e","source":{"kind":"arxiv","id":"1207.1133","version":3},"attestation_state":"computed","paper":{"title":"Finite random coverings of one-complexes and the Euler characteristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.AT","authors_text":"Jeffrey Pullen, Rafal Komendarczyk","submitted_at":"2012-07-04T22:13:11Z","abstract_excerpt":"This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one dimensional case. In particular we obtain a general formula for the chance that a collection of finitely many compact connected random sets placed on $X$ has a union equal to $X$. The result is derived under certain topological assumptions on the shape of the covering sets (the covering ought to be {\\em good}, which holds if the diameter of the covering elements do"},"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":"1207.1133","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2012-07-04T22:13:11Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f27faf37ef2db291cd05b04e18e75ce58689076097bda7a450167bb305f0071a","abstract_canon_sha256":"a351ba61771010d8a885b31ce0d59cc1e529acc931031184ce89bb105aaf09b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:32.858367Z","signature_b64":"RXD5i/xBj6QMCFB8obiZuijEGz7lku2Y5p+vhMdAxRb7K+ZLoqUCItV18u3fR00PimZL6Zz2I7td7qnLroJkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"964a9e359ec18c4aa5536cffe6477ff979be34b3fb5592c059ed1c5201f86c3e","last_reissued_at":"2026-05-18T01:33:32.857763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:32.857763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite random coverings of one-complexes and the Euler characteristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.AT","authors_text":"Jeffrey Pullen, Rafal Komendarczyk","submitted_at":"2012-07-04T22:13:11Z","abstract_excerpt":"This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one dimensional case. In particular we obtain a general formula for the chance that a collection of finitely many compact connected random sets placed on $X$ has a union equal to $X$. The result is derived under certain topological assumptions on the shape of the covering sets (the covering ought to be {\\em good}, which holds if the diameter of the covering elements do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1133","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":"1207.1133","created_at":"2026-05-18T01:33:32.857849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1133v3","created_at":"2026-05-18T01:33:32.857849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1133","created_at":"2026-05-18T01:33:32.857849+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZFJ4NM6YGGE","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZFJ4NM6YGGEVJKT","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZFJ4NM6","created_at":"2026-05-18T12:27:23.164592+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/SZFJ4NM6YGGEVJKTNT76MR377F","json":"https://pith.science/pith/SZFJ4NM6YGGEVJKTNT76MR377F.json","graph_json":"https://pith.science/api/pith-number/SZFJ4NM6YGGEVJKTNT76MR377F/graph.json","events_json":"https://pith.science/api/pith-number/SZFJ4NM6YGGEVJKTNT76MR377F/events.json","paper":"https://pith.science/paper/SZFJ4NM6"},"agent_actions":{"view_html":"https://pith.science/pith/SZFJ4NM6YGGEVJKTNT76MR377F","download_json":"https://pith.science/pith/SZFJ4NM6YGGEVJKTNT76MR377F.json","view_paper":"https://pith.science/paper/SZFJ4NM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1133&json=true","fetch_graph":"https://pith.science/api/pith-number/SZFJ4NM6YGGEVJKTNT76MR377F/graph.json","fetch_events":"https://pith.science/api/pith-number/SZFJ4NM6YGGEVJKTNT76MR377F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZFJ4NM6YGGEVJKTNT76MR377F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZFJ4NM6YGGEVJKTNT76MR377F/action/storage_attestation","attest_author":"https://pith.science/pith/SZFJ4NM6YGGEVJKTNT76MR377F/action/author_attestation","sign_citation":"https://pith.science/pith/SZFJ4NM6YGGEVJKTNT76MR377F/action/citation_signature","submit_replication":"https://pith.science/pith/SZFJ4NM6YGGEVJKTNT76MR377F/action/replication_record"}},"created_at":"2026-05-18T01:33:32.857849+00:00","updated_at":"2026-05-18T01:33:32.857849+00:00"}