{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JQVO2AVDSPJFVBL7S2L4QNZZL4","short_pith_number":"pith:JQVO2AVD","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"},"canonical_sha256":"4c2aed02a393d25a857f9697c837395f37a34e53e992a9184c1286525686359a","source":{"kind":"arxiv","id":"1811.01413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01413","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01413v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01413","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"JQVO2AVDSPJF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JQVO2AVDSPJFVBL7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JQVO2AVD","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JQVO2AVDSPJFVBL7S2L4QNZZL4","target":"record","payload":{"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"},"canonical_sha256":"4c2aed02a393d25a857f9697c837395f37a34e53e992a9184c1286525686359a","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"},"source_kind":"arxiv","source_id":"1811.01413","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-05-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVbSv+4FP9d0iekTaMBWO02GANuT/Rn4oMpXNoniR5FbJi59RPrcqnApuOqYh1qJmYmWSJQs3G3WoBm2Ng61Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:38:01.120649Z"},"content_sha256":"07fb0ae5a8c0ce0fcba3371720cb93e2d8c88e7110978d8a735d27dbc8929451","schema_version":"1.0","event_id":"sha256:07fb0ae5a8c0ce0fcba3371720cb93e2d8c88e7110978d8a735d27dbc8929451"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JQVO2AVDSPJFVBL7S2L4QNZZL4","target":"graph","payload":{"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"},"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-05-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F11ALsp+fnedeloTwSF2fpstHVmlosP7iJUhBf5pb0sGgoYhDIKFeshbYS5LjmfHWci/16657JsBRc+6ym20DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:38:01.120993Z"},"content_sha256":"6bb793da58b8c35c9f124b9aad5d2066715686d9ba30f3fc18e551490c5f15cd","schema_version":"1.0","event_id":"sha256:6bb793da58b8c35c9f124b9aad5d2066715686d9ba30f3fc18e551490c5f15cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/bundle.json","state_url":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/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-06-08T22:38:01Z","links":{"resolver":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4","bundle":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/bundle.json","state":"https://pith.science/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQVO2AVDSPJFVBL7S2L4QNZZL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JQVO2AVDSPJFVBL7S2L4QNZZL4","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":"6cd613551058aa6539d0b0d9e66ca00f46431d4516965af14ba5708feaf8c672","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-11-04T18:18:45Z","title_canon_sha256":"683cb7fed34b2deb44e577fa1d04975bebeb158373de01cf3f71dca0705bee79"},"schema_version":"1.0","source":{"id":"1811.01413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01413","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01413v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01413","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"JQVO2AVDSPJF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JQVO2AVDSPJFVBL7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JQVO2AVD","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:6bb793da58b8c35c9f124b9aad5d2066715686d9ba30f3fc18e551490c5f15cd","target":"graph","created_at":"2026-05-18T00:01:34Z","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"},"paper":{"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.","authors_text":"Joshua Evan Greene","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-11-04T18:18:45Z","title":"On curves intersecting at most once, II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01413","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:07fb0ae5a8c0ce0fcba3371720cb93e2d8c88e7110978d8a735d27dbc8929451","target":"record","created_at":"2026-05-18T00:01:34Z","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":"6cd613551058aa6539d0b0d9e66ca00f46431d4516965af14ba5708feaf8c672","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-11-04T18:18:45Z","title_canon_sha256":"683cb7fed34b2deb44e577fa1d04975bebeb158373de01cf3f71dca0705bee79"},"schema_version":"1.0","source":{"id":"1811.01413","kind":"arxiv","version":1}},"canonical_sha256":"4c2aed02a393d25a857f9697c837395f37a34e53e992a9184c1286525686359a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c2aed02a393d25a857f9697c837395f37a34e53e992a9184c1286525686359a","first_computed_at":"2026-05-18T00:01:34.376381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.376381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xb+oZIzG0no5hInGUaQ9ZdW3jLs5vR2OLo3K3CMQy9v3D7UZH8wRYHhqYlDyLc7N33wQBhGZ4CLagdgZGQ6WCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.376927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07fb0ae5a8c0ce0fcba3371720cb93e2d8c88e7110978d8a735d27dbc8929451","sha256:6bb793da58b8c35c9f124b9aad5d2066715686d9ba30f3fc18e551490c5f15cd"],"state_sha256":"7f7df044995d0bc64aeeb2961545480ebfd3628093380d1d153dc24a03e608c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJ75cdOwFPNWefrLYxyFbU+SesnL1GulTBEt1QbTLHzmQG9CO5aPoaAhnQQkoqzTJI5at7umNAdz7/v7RRUVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:38:01.122877Z","bundle_sha256":"e8135613a1a8403a394a520204d65abefa801fc9bf5e9155889ae65ee5e6db94"}}