{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JQVO2AVDSPJFVBL7S2L4QNZZL4","short_pith_number":"pith:JQVO2AVD","schema_version":"1.0","canonical_sha256":"4c2aed02a393d25a857f9697c837395f37a34e53e992a9184c1286525686359a","source":{"kind":"arxiv","id":"1811.01413","version":1},"attestation_state":"computed","paper":{"title":"On curves intersecting at most once, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Joshua Evan Greene","submitted_at":"2018-11-04T18:18:45Z","abstract_excerpt":"We prove that on a closed, orientable surface of genus $g$, a set of simple loops with the property that no two are homotopic or intersect in more than $k$ points has cardinality $\\lesssim_k g^{k+1} \\log g$. The bound matches the size of the largest known construction to within a factor of $\\sim_k \\log g$. It generalizes an earlier result of the author, which treated the case $k=1$. The proof blends probabilistic ideas with covering space arguments related to the fact that surface groups are LERF."},"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":"1811.01413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-11-04T18:18:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"683cb7fed34b2deb44e577fa1d04975bebeb158373de01cf3f71dca0705bee79","abstract_canon_sha256":"6cd613551058aa6539d0b0d9e66ca00f46431d4516965af14ba5708feaf8c672"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.376927Z","signature_b64":"Xb+oZIzG0no5hInGUaQ9ZdW3jLs5vR2OLo3K3CMQy9v3D7UZH8wRYHhqYlDyLc7N33wQBhGZ4CLagdgZGQ6WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c2aed02a393d25a857f9697c837395f37a34e53e992a9184c1286525686359a","last_reissued_at":"2026-05-18T00:01:34.376381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.376381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On curves intersecting at most once, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Joshua Evan Greene","submitted_at":"2018-11-04T18:18:45Z","abstract_excerpt":"We prove that on a closed, orientable surface of genus $g$, a set of simple loops with the property that no two are homotopic or intersect in more than $k$ points has cardinality $\\lesssim_k g^{k+1} \\log g$. The bound matches the size of the largest known construction to within a factor of $\\sim_k \\log g$. It generalizes an earlier result of the author, which treated the case $k=1$. The proof blends probabilistic ideas with covering space arguments related to the fact that surface groups are LERF."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01413","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":"1811.01413","created_at":"2026-05-18T00:01:34.376484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01413v1","created_at":"2026-05-18T00:01:34.376484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01413","created_at":"2026-05-18T00:01:34.376484+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQVO2AVDSPJF","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQVO2AVDSPJFVBL7","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQVO2AVD","created_at":"2026-05-18T12:32:31.084164+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/JQVO2AVDSPJFVBL7S2L4QNZZL4","json":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4.json","graph_json":"https://pith.science/api/pith-number/JQVO2AVDSPJFVBL7S2L4QNZZL4/graph.json","events_json":"https://pith.science/api/pith-number/JQVO2AVDSPJFVBL7S2L4QNZZL4/events.json","paper":"https://pith.science/paper/JQVO2AVD"},"agent_actions":{"view_html":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4","download_json":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4.json","view_paper":"https://pith.science/paper/JQVO2AVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01413&json=true","fetch_graph":"https://pith.science/api/pith-number/JQVO2AVDSPJFVBL7S2L4QNZZL4/graph.json","fetch_events":"https://pith.science/api/pith-number/JQVO2AVDSPJFVBL7S2L4QNZZL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/action/storage_attestation","attest_author":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/action/author_attestation","sign_citation":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/action/citation_signature","submit_replication":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/action/replication_record"}},"created_at":"2026-05-18T00:01:34.376484+00:00","updated_at":"2026-05-18T00:01:34.376484+00:00"}