{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YCLZQWLBDG2IPLS7YDSOSUHHFL","short_pith_number":"pith:YCLZQWLB","canonical_record":{"source":{"id":"1406.0107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-31T20:09:34Z","cross_cats_sorted":["math.CA","math.NT"],"title_canon_sha256":"6e10986553e3e52106aa266d529f12142878f6f60c651d53f3caf01fbcff2915","abstract_canon_sha256":"9d28b69f51fbbe28c5ee2664f8d10c2c622552069420f2b5393523dc825029a6"},"schema_version":"1.0"},"canonical_sha256":"c09798596119b487ae5fc0e4e950e72afc4588a86ba3f4d76c3258654a776aba","source":{"kind":"arxiv","id":"1406.0107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0107","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0107v1","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0107","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"YCLZQWLBDG2I","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YCLZQWLBDG2IPLS7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YCLZQWLB","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YCLZQWLBDG2IPLS7YDSOSUHHFL","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-31T20:09:34Z","cross_cats_sorted":["math.CA","math.NT"],"title_canon_sha256":"6e10986553e3e52106aa266d529f12142878f6f60c651d53f3caf01fbcff2915","abstract_canon_sha256":"9d28b69f51fbbe28c5ee2664f8d10c2c622552069420f2b5393523dc825029a6"},"schema_version":"1.0"},"canonical_sha256":"c09798596119b487ae5fc0e4e950e72afc4588a86ba3f4d76c3258654a776aba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:41.760132Z","signature_b64":"rScFHJJGEncnEzm5CFM2SmQOepLO8w88+WYOtgh5UrUML22/K0E+jWCUr4k66DzETXINWXrGxnPvwRhm+UM8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c09798596119b487ae5fc0e4e950e72afc4588a86ba3f4d76c3258654a776aba","last_reissued_at":"2026-05-18T02:50:41.759680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:41.759680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0107","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-18T02:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqicCh8+mDBGy4HGXd/pjcrqusTbaVesPPZBZMskoP5VJMi8UceC+rycNsZ8hGF39zS+WiWww/x8pCZsjkB1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:29:55.023840Z"},"content_sha256":"0e50388c22ef3842e36b5954eb989fafd8aab4d3db36d3f3a9bfc259a4d116f8","schema_version":"1.0","event_id":"sha256:0e50388c22ef3842e36b5954eb989fafd8aab4d3db36d3f3a9bfc259a4d116f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YCLZQWLBDG2IPLS7YDSOSUHHFL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long paths in the distance graph over large subsets of vector spaces over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.NT"],"primary_cat":"math.CO","authors_text":"A. Iosevich, D. Covert, D. Hart, J. Chapman, J. Pakianathan, M. Bennett","submitted_at":"2014-05-31T20:09:34Z","abstract_excerpt":"Let $E \\subset {\\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices corresponding to vectors $x,y \\in E$ by an edge if $||x-y||={(x_1-y_1)}^2+\\dots+{(x_d-y_d)}^2=1$. We shall prove that if the size of $E$ is sufficiently large, then the distance graph of $E$ contains long non-overlapping paths and vertices of high degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0107","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-18T02:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67xyzcPnp2nTEEkGNQMEJDavMjl1ILnOysH2cS/LOS5jEc4Zzgg5u0OkKY7alK7Z8RfgbKQBALvokzDlaz2RAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:29:55.024564Z"},"content_sha256":"b3f32d84b15b6f4a8dae1e13d44e84a3c236e897e7651d8179a0f444080973b8","schema_version":"1.0","event_id":"sha256:b3f32d84b15b6f4a8dae1e13d44e84a3c236e897e7651d8179a0f444080973b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YCLZQWLBDG2IPLS7YDSOSUHHFL/bundle.json","state_url":"https://pith.science/pith/YCLZQWLBDG2IPLS7YDSOSUHHFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YCLZQWLBDG2IPLS7YDSOSUHHFL/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-05-26T00:29:55Z","links":{"resolver":"https://pith.science/pith/YCLZQWLBDG2IPLS7YDSOSUHHFL","bundle":"https://pith.science/pith/YCLZQWLBDG2IPLS7YDSOSUHHFL/bundle.json","state":"https://pith.science/pith/YCLZQWLBDG2IPLS7YDSOSUHHFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YCLZQWLBDG2IPLS7YDSOSUHHFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YCLZQWLBDG2IPLS7YDSOSUHHFL","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":"9d28b69f51fbbe28c5ee2664f8d10c2c622552069420f2b5393523dc825029a6","cross_cats_sorted":["math.CA","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-31T20:09:34Z","title_canon_sha256":"6e10986553e3e52106aa266d529f12142878f6f60c651d53f3caf01fbcff2915"},"schema_version":"1.0","source":{"id":"1406.0107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0107","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0107v1","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0107","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"YCLZQWLBDG2I","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YCLZQWLBDG2IPLS7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YCLZQWLB","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:b3f32d84b15b6f4a8dae1e13d44e84a3c236e897e7651d8179a0f444080973b8","target":"graph","created_at":"2026-05-18T02:50:41Z","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":"Let $E \\subset {\\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices corresponding to vectors $x,y \\in E$ by an edge if $||x-y||={(x_1-y_1)}^2+\\dots+{(x_d-y_d)}^2=1$. We shall prove that if the size of $E$ is sufficiently large, then the distance graph of $E$ contains long non-overlapping paths and vertices of high degree.","authors_text":"A. Iosevich, D. Covert, D. Hart, J. Chapman, J. Pakianathan, M. Bennett","cross_cats":["math.CA","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-31T20:09:34Z","title":"Long paths in the distance graph over large subsets of vector spaces over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0107","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:0e50388c22ef3842e36b5954eb989fafd8aab4d3db36d3f3a9bfc259a4d116f8","target":"record","created_at":"2026-05-18T02:50:41Z","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":"9d28b69f51fbbe28c5ee2664f8d10c2c622552069420f2b5393523dc825029a6","cross_cats_sorted":["math.CA","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-31T20:09:34Z","title_canon_sha256":"6e10986553e3e52106aa266d529f12142878f6f60c651d53f3caf01fbcff2915"},"schema_version":"1.0","source":{"id":"1406.0107","kind":"arxiv","version":1}},"canonical_sha256":"c09798596119b487ae5fc0e4e950e72afc4588a86ba3f4d76c3258654a776aba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c09798596119b487ae5fc0e4e950e72afc4588a86ba3f4d76c3258654a776aba","first_computed_at":"2026-05-18T02:50:41.759680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:41.759680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rScFHJJGEncnEzm5CFM2SmQOepLO8w88+WYOtgh5UrUML22/K0E+jWCUr4k66DzETXINWXrGxnPvwRhm+UM8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:41.760132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e50388c22ef3842e36b5954eb989fafd8aab4d3db36d3f3a9bfc259a4d116f8","sha256:b3f32d84b15b6f4a8dae1e13d44e84a3c236e897e7651d8179a0f444080973b8"],"state_sha256":"261efc70f9b58b7c9597bc0151b538f03e1eab4a00698e8a59883b487f81fe63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"McxZ1gJsS96uzoF/+LMCiCy16ElQZiSc/Cm2bd7oIB3rFADXVOEbokouX8snuhUtZmZnR5jz9ABjGTEL6KQYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:29:55.028568Z","bundle_sha256":"bc26980368f3b360a6502c3b34e0266f474ab97c35b2b795c1059b27bc3d5506"}}