{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AA4XHDVG573MHM63LUX4CSIQ55","short_pith_number":"pith:AA4XHDVG","canonical_record":{"source":{"id":"1908.00200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-08-01T03:58:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fa3f6610bd911a74816bcaa2aa2598cae9bce602e2e5778aa741e734a722d7ed","abstract_canon_sha256":"062c2339afb35c61b3c1ce70cb37410c5ae4a111542f223ae1bc50abf14d02ed"},"schema_version":"1.0"},"canonical_sha256":"0039738ea6eff6c3b3db5d2fc14910ef6b9558870d135e62caae6452b6c61090","source":{"kind":"arxiv","id":"1908.00200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00200","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00200v1","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00200","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"AA4XHDVG573M","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_16","alias_value":"AA4XHDVG573MHM63","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_8","alias_value":"AA4XHDVG","created_at":"2026-07-04T23:50:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AA4XHDVG573MHM63LUX4CSIQ55","target":"record","payload":{"canonical_record":{"source":{"id":"1908.00200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-08-01T03:58:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fa3f6610bd911a74816bcaa2aa2598cae9bce602e2e5778aa741e734a722d7ed","abstract_canon_sha256":"062c2339afb35c61b3c1ce70cb37410c5ae4a111542f223ae1bc50abf14d02ed"},"schema_version":"1.0"},"canonical_sha256":"0039738ea6eff6c3b3db5d2fc14910ef6b9558870d135e62caae6452b6c61090","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:57.924561Z","signature_b64":"63TPcUjQqAJlRqHmdOQKUo1DsTFL5BMff7WfeU99ahlqeAum+mFTx6UbF6qv426jGnfitutXXIc5AXidQMHaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0039738ea6eff6c3b3db5d2fc14910ef6b9558870d135e62caae6452b6c61090","last_reissued_at":"2026-07-04T23:50:57.924161Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:57.924161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.00200","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-07-04T23:50:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bK5WO+WmlbmSM1GkJ2vL1UhZjuqhCI6Bh/+3VXpcmdSpI3Adj96S5bhI3qPutuIk2q14Kcgf6cOwe6kn8DNHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:24:52.329034Z"},"content_sha256":"e0da6be736c2191e292d80965bae3ca8e3c4819ee6b541b963d77db2dcb63c69","schema_version":"1.0","event_id":"sha256:e0da6be736c2191e292d80965bae3ca8e3c4819ee6b541b963d77db2dcb63c69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AA4XHDVG573MHM63LUX4CSIQ55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"KiloGrams: Very Large N-Grams for Malware Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CR","authors_text":"Bill Finlayson, Charles Nicholas, Edward Raff, Hyrum Anderson, Mark McLean, Richard Zak, William Fleming","submitted_at":"2019-08-01T03:58:11Z","abstract_excerpt":"N-grams have been a common tool for information retrieval and machine learning applications for decades. In nearly all previous works, only a few values of $n$ are tested, with $n > 6$ being exceedingly rare. Larger values of $n$ are not tested due to computational burden or the fear of overfitting. In this work, we present a method to find the top-$k$ most frequent $n$-grams that is 60$\\times$ faster for small $n$, and can tackle large $n\\geq1024$. Despite the unprecedented size of $n$ considered, we show how these features still have predictive ability for malware classification tasks. More "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00200","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.00200/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:50:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kg4VSL4nvj5qh9TWdZBVJOtIQ5y0tPCPO/VwXdZXqhglO/lCrcd48px5/SbRzulWPmtJjeADBqu9LlRtq8/aBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:24:52.329423Z"},"content_sha256":"6f5fcb21b9875587df6a9909fd72d6edf419f6da14f1a0a5f8230761b90f158b","schema_version":"1.0","event_id":"sha256:6f5fcb21b9875587df6a9909fd72d6edf419f6da14f1a0a5f8230761b90f158b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AA4XHDVG573MHM63LUX4CSIQ55/bundle.json","state_url":"https://pith.science/pith/AA4XHDVG573MHM63LUX4CSIQ55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AA4XHDVG573MHM63LUX4CSIQ55/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-07-06T23:24:52Z","links":{"resolver":"https://pith.science/pith/AA4XHDVG573MHM63LUX4CSIQ55","bundle":"https://pith.science/pith/AA4XHDVG573MHM63LUX4CSIQ55/bundle.json","state":"https://pith.science/pith/AA4XHDVG573MHM63LUX4CSIQ55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AA4XHDVG573MHM63LUX4CSIQ55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AA4XHDVG573MHM63LUX4CSIQ55","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":"062c2339afb35c61b3c1ce70cb37410c5ae4a111542f223ae1bc50abf14d02ed","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-08-01T03:58:11Z","title_canon_sha256":"fa3f6610bd911a74816bcaa2aa2598cae9bce602e2e5778aa741e734a722d7ed"},"schema_version":"1.0","source":{"id":"1908.00200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00200","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00200v1","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00200","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"AA4XHDVG573M","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_16","alias_value":"AA4XHDVG573MHM63","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_8","alias_value":"AA4XHDVG","created_at":"2026-07-04T23:50:57Z"}],"graph_snapshots":[{"event_id":"sha256:6f5fcb21b9875587df6a9909fd72d6edf419f6da14f1a0a5f8230761b90f158b","target":"graph","created_at":"2026-07-04T23:50:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.00200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"N-grams have been a common tool for information retrieval and machine learning applications for decades. In nearly all previous works, only a few values of $n$ are tested, with $n > 6$ being exceedingly rare. Larger values of $n$ are not tested due to computational burden or the fear of overfitting. In this work, we present a method to find the top-$k$ most frequent $n$-grams that is 60$\\times$ faster for small $n$, and can tackle large $n\\geq1024$. Despite the unprecedented size of $n$ considered, we show how these features still have predictive ability for malware classification tasks. More ","authors_text":"Bill Finlayson, Charles Nicholas, Edward Raff, Hyrum Anderson, Mark McLean, Richard Zak, William Fleming","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-08-01T03:58:11Z","title":"KiloGrams: Very Large N-Grams for Malware Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00200","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:e0da6be736c2191e292d80965bae3ca8e3c4819ee6b541b963d77db2dcb63c69","target":"record","created_at":"2026-07-04T23:50:57Z","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":"062c2339afb35c61b3c1ce70cb37410c5ae4a111542f223ae1bc50abf14d02ed","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-08-01T03:58:11Z","title_canon_sha256":"fa3f6610bd911a74816bcaa2aa2598cae9bce602e2e5778aa741e734a722d7ed"},"schema_version":"1.0","source":{"id":"1908.00200","kind":"arxiv","version":1}},"canonical_sha256":"0039738ea6eff6c3b3db5d2fc14910ef6b9558870d135e62caae6452b6c61090","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0039738ea6eff6c3b3db5d2fc14910ef6b9558870d135e62caae6452b6c61090","first_computed_at":"2026-07-04T23:50:57.924161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:50:57.924161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"63TPcUjQqAJlRqHmdOQKUo1DsTFL5BMff7WfeU99ahlqeAum+mFTx6UbF6qv426jGnfitutXXIc5AXidQMHaCg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:50:57.924561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0da6be736c2191e292d80965bae3ca8e3c4819ee6b541b963d77db2dcb63c69","sha256:6f5fcb21b9875587df6a9909fd72d6edf419f6da14f1a0a5f8230761b90f158b"],"state_sha256":"127f9206923a031c0a9d2008f0a303ec3040eae6c0de8c27a6391e3cd3456ae4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fE3ZNwSTRHTvWxTTGV83rEM+py1BSRpa2VuLvBFF26qEgI3vAowMYYqPqAuH7Oze/umOkLjDa9U1nAQRp9cBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:24:52.332156Z","bundle_sha256":"5c188b02741c926edbe09860ae70da568f1b4ec7be734a2cd31004a926cc4578"}}