{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YUTTQFO7EISCWDONWWDWUR2HN7","short_pith_number":"pith:YUTTQFO7","schema_version":"1.0","canonical_sha256":"c5273815df22242b0dcdb5876a47476fe38fc93591b3ef33d2f6b2bf9e71e366","source":{"kind":"arxiv","id":"1310.4681","version":1},"attestation_state":"computed","paper":{"title":"Random index of codivisibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Jos\\'e L. Fern\\'andez, Pablo Fern\\'andez","submitted_at":"2013-10-17T12:57:54Z","abstract_excerpt":"The index of codivisibility of a set of integers is the size of its largest subset with a common prime divisor. For large random samples of integers, the index of codivisibility is approximately normal."},"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":"1310.4681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-17T12:57:54Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e47ee13600c51176c931e554774a754de1837888093b829216e3cedb9d814449","abstract_canon_sha256":"9f82852e095185f399c2ec96967f87e0cc9e0b5df42960af1014af54c0912701"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:13.230718Z","signature_b64":"hvG7Ne60vM0gBCEsX/9teKeyrBdfVVQNE7PFlgAXh+oFtxXLK7eASljYxpiaExqcNjJixHYkN0k1h1cjF2JsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5273815df22242b0dcdb5876a47476fe38fc93591b3ef33d2f6b2bf9e71e366","last_reissued_at":"2026-05-18T03:10:13.230203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:13.230203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random index of codivisibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Jos\\'e L. Fern\\'andez, Pablo Fern\\'andez","submitted_at":"2013-10-17T12:57:54Z","abstract_excerpt":"The index of codivisibility of a set of integers is the size of its largest subset with a common prime divisor. For large random samples of integers, the index of codivisibility is approximately normal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4681","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":""},"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":"1310.4681","created_at":"2026-05-18T03:10:13.230277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4681v1","created_at":"2026-05-18T03:10:13.230277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4681","created_at":"2026-05-18T03:10:13.230277+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUTTQFO7EISC","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUTTQFO7EISCWDON","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUTTQFO7","created_at":"2026-05-18T12:28:09.283467+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/YUTTQFO7EISCWDONWWDWUR2HN7","json":"https://pith.science/pith/YUTTQFO7EISCWDONWWDWUR2HN7.json","graph_json":"https://pith.science/api/pith-number/YUTTQFO7EISCWDONWWDWUR2HN7/graph.json","events_json":"https://pith.science/api/pith-number/YUTTQFO7EISCWDONWWDWUR2HN7/events.json","paper":"https://pith.science/paper/YUTTQFO7"},"agent_actions":{"view_html":"https://pith.science/pith/YUTTQFO7EISCWDONWWDWUR2HN7","download_json":"https://pith.science/pith/YUTTQFO7EISCWDONWWDWUR2HN7.json","view_paper":"https://pith.science/paper/YUTTQFO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4681&json=true","fetch_graph":"https://pith.science/api/pith-number/YUTTQFO7EISCWDONWWDWUR2HN7/graph.json","fetch_events":"https://pith.science/api/pith-number/YUTTQFO7EISCWDONWWDWUR2HN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUTTQFO7EISCWDONWWDWUR2HN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUTTQFO7EISCWDONWWDWUR2HN7/action/storage_attestation","attest_author":"https://pith.science/pith/YUTTQFO7EISCWDONWWDWUR2HN7/action/author_attestation","sign_citation":"https://pith.science/pith/YUTTQFO7EISCWDONWWDWUR2HN7/action/citation_signature","submit_replication":"https://pith.science/pith/YUTTQFO7EISCWDONWWDWUR2HN7/action/replication_record"}},"created_at":"2026-05-18T03:10:13.230277+00:00","updated_at":"2026-05-18T03:10:13.230277+00:00"}