{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DQXMJCFLKP5ZGHVF2TO2QKOFPM","short_pith_number":"pith:DQXMJCFL","schema_version":"1.0","canonical_sha256":"1c2ec488ab53fb931ea5d4dda829c57b0a1df0fa3796f7eb656118267b9ceaad","source":{"kind":"arxiv","id":"1905.05407","version":1},"attestation_state":"computed","paper":{"title":"On the number of k-skip-n-grams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dmytro Krasnoshtan","submitted_at":"2019-05-14T06:18:35Z","abstract_excerpt":"The paper proves that the number of k-skip-n-grams for a corpus of size $L$ is $$\\frac{Ln + n + k' - n^2 - nk'}{n} \\cdot \\binom{n-1+k'}{n-1}$$ where $k' = \\min(L - n + 1, k)$."},"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":"1905.05407","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2019-05-14T06:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"07fafb460075bb5b70a1d7c4a44fa96352d630cfdc774f5ef31aa59e0e9a261e","abstract_canon_sha256":"18c9ad8296fefb81393ffdbd551add27a035b6977990e3323d7c0ef7d380c1a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:16.585532Z","signature_b64":"yEwnFxelTQtqJ4gbHzsuJUmibKZ4kUZrK3ynlShuUUwPKm5d6q1DC8YosdZPm1H9Ms22viaJvvRu5pVqMN1GBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c2ec488ab53fb931ea5d4dda829c57b0a1df0fa3796f7eb656118267b9ceaad","last_reissued_at":"2026-05-17T23:46:16.584905Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:16.584905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of k-skip-n-grams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dmytro Krasnoshtan","submitted_at":"2019-05-14T06:18:35Z","abstract_excerpt":"The paper proves that the number of k-skip-n-grams for a corpus of size $L$ is $$\\frac{Ln + n + k' - n^2 - nk'}{n} \\cdot \\binom{n-1+k'}{n-1}$$ where $k' = \\min(L - n + 1, k)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05407","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":"1905.05407","created_at":"2026-05-17T23:46:16.584999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.05407v1","created_at":"2026-05-17T23:46:16.584999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05407","created_at":"2026-05-17T23:46:16.584999+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQXMJCFLKP5Z","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQXMJCFLKP5ZGHVF","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQXMJCFL","created_at":"2026-05-18T12:33:15.570797+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/DQXMJCFLKP5ZGHVF2TO2QKOFPM","json":"https://pith.science/pith/DQXMJCFLKP5ZGHVF2TO2QKOFPM.json","graph_json":"https://pith.science/api/pith-number/DQXMJCFLKP5ZGHVF2TO2QKOFPM/graph.json","events_json":"https://pith.science/api/pith-number/DQXMJCFLKP5ZGHVF2TO2QKOFPM/events.json","paper":"https://pith.science/paper/DQXMJCFL"},"agent_actions":{"view_html":"https://pith.science/pith/DQXMJCFLKP5ZGHVF2TO2QKOFPM","download_json":"https://pith.science/pith/DQXMJCFLKP5ZGHVF2TO2QKOFPM.json","view_paper":"https://pith.science/paper/DQXMJCFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.05407&json=true","fetch_graph":"https://pith.science/api/pith-number/DQXMJCFLKP5ZGHVF2TO2QKOFPM/graph.json","fetch_events":"https://pith.science/api/pith-number/DQXMJCFLKP5ZGHVF2TO2QKOFPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQXMJCFLKP5ZGHVF2TO2QKOFPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQXMJCFLKP5ZGHVF2TO2QKOFPM/action/storage_attestation","attest_author":"https://pith.science/pith/DQXMJCFLKP5ZGHVF2TO2QKOFPM/action/author_attestation","sign_citation":"https://pith.science/pith/DQXMJCFLKP5ZGHVF2TO2QKOFPM/action/citation_signature","submit_replication":"https://pith.science/pith/DQXMJCFLKP5ZGHVF2TO2QKOFPM/action/replication_record"}},"created_at":"2026-05-17T23:46:16.584999+00:00","updated_at":"2026-05-17T23:46:16.584999+00:00"}