{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LDK6WK3OMPLW2PCMRQ7AVS75YR","short_pith_number":"pith:LDK6WK3O","canonical_record":{"source":{"id":"1511.06606","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-20T14:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"9eff0d41b31eded12deaff0864cb07fbd2869669d0b1341636f803a7c4569468","abstract_canon_sha256":"149b0dbee54d9d1e1d16ce2ed8b5cafa92c5912b0a136e5dd9b639abf4665c98"},"schema_version":"1.0"},"canonical_sha256":"58d5eb2b6e63d76d3c4c8c3e0acbfdc45e1c8725b751859330938f6425fb237b","source":{"kind":"arxiv","id":"1511.06606","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06606","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06606v5","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06606","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"pith_short_12","alias_value":"LDK6WK3OMPLW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDK6WK3OMPLW2PCM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDK6WK3O","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LDK6WK3OMPLW2PCMRQ7AVS75YR","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06606","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-20T14:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"9eff0d41b31eded12deaff0864cb07fbd2869669d0b1341636f803a7c4569468","abstract_canon_sha256":"149b0dbee54d9d1e1d16ce2ed8b5cafa92c5912b0a136e5dd9b639abf4665c98"},"schema_version":"1.0"},"canonical_sha256":"58d5eb2b6e63d76d3c4c8c3e0acbfdc45e1c8725b751859330938f6425fb237b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:51.944581Z","signature_b64":"wwbFdTCiOPyCPf9bYGPA9t7bcLEcH4blFvDYI3sX3uNvRSBx2SIPRB0OXW/dImFzSy4+rWxVryyOjbsDPn9lDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58d5eb2b6e63d76d3c4c8c3e0acbfdc45e1c8725b751859330938f6425fb237b","last_reissued_at":"2026-05-18T01:15:51.943998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:51.943998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06606","source_version":5,"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-18T01:15:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66UtyCeBHv4zRqTSqk7xK+qp2cJTidob9VbIf18gRU7JjFFcIzJ1zWuwDd9sOZ+zm7jd870KnitbKv9KWWq8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:52:09.048755Z"},"content_sha256":"ab5e5adf66140aab00ccf11f8ece40c98aa7018cb4443926485a9c810b09e326","schema_version":"1.0","event_id":"sha256:ab5e5adf66140aab00ccf11f8ece40c98aa7018cb4443926485a9c810b09e326"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LDK6WK3OMPLW2PCMRQ7AVS75YR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Representation and Compression Using Linear-Programming Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hristo S. Paskov, John C. Mitchell, Trevor J. Hastie","submitted_at":"2015-11-20T14:21:44Z","abstract_excerpt":"We propose `Dracula', a new framework for unsupervised feature selection from sequential data such as text. Dracula learns a dictionary of $n$-grams that efficiently compresses a given corpus and recursively compresses its own dictionary; in effect, Dracula is a `deep' extension of Compressive Feature Learning. It requires solving a binary linear program that may be relaxed to a linear program. Both problems exhibit considerable structure, their solution paths are well behaved, and we identify parameters which control the depth and diversity of the dictionary. We also discuss how to derive fea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06606","kind":"arxiv","version":5},"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-18T01:15:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0NFZIs5ZXk2HSI0yRg72Pm4SEV4XphbOZkn9TDBLhnPXFkJkgfycqvxjLCpfn0p8AUoE03qRFcIm0wu2lHXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:52:09.049090Z"},"content_sha256":"0199a16aa665dde8d01e0c5740af5acba6c35a576aee581d540ac2673bc89389","schema_version":"1.0","event_id":"sha256:0199a16aa665dde8d01e0c5740af5acba6c35a576aee581d540ac2673bc89389"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDK6WK3OMPLW2PCMRQ7AVS75YR/bundle.json","state_url":"https://pith.science/pith/LDK6WK3OMPLW2PCMRQ7AVS75YR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDK6WK3OMPLW2PCMRQ7AVS75YR/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-27T02:52:09Z","links":{"resolver":"https://pith.science/pith/LDK6WK3OMPLW2PCMRQ7AVS75YR","bundle":"https://pith.science/pith/LDK6WK3OMPLW2PCMRQ7AVS75YR/bundle.json","state":"https://pith.science/pith/LDK6WK3OMPLW2PCMRQ7AVS75YR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDK6WK3OMPLW2PCMRQ7AVS75YR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LDK6WK3OMPLW2PCMRQ7AVS75YR","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":"149b0dbee54d9d1e1d16ce2ed8b5cafa92c5912b0a136e5dd9b639abf4665c98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-20T14:21:44Z","title_canon_sha256":"9eff0d41b31eded12deaff0864cb07fbd2869669d0b1341636f803a7c4569468"},"schema_version":"1.0","source":{"id":"1511.06606","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06606","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06606v5","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06606","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"pith_short_12","alias_value":"LDK6WK3OMPLW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LDK6WK3OMPLW2PCM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LDK6WK3O","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:0199a16aa665dde8d01e0c5740af5acba6c35a576aee581d540ac2673bc89389","target":"graph","created_at":"2026-05-18T01:15:51Z","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 propose `Dracula', a new framework for unsupervised feature selection from sequential data such as text. Dracula learns a dictionary of $n$-grams that efficiently compresses a given corpus and recursively compresses its own dictionary; in effect, Dracula is a `deep' extension of Compressive Feature Learning. It requires solving a binary linear program that may be relaxed to a linear program. Both problems exhibit considerable structure, their solution paths are well behaved, and we identify parameters which control the depth and diversity of the dictionary. We also discuss how to derive fea","authors_text":"Hristo S. Paskov, John C. Mitchell, Trevor J. Hastie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-20T14:21:44Z","title":"Data Representation and Compression Using Linear-Programming Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06606","kind":"arxiv","version":5},"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:ab5e5adf66140aab00ccf11f8ece40c98aa7018cb4443926485a9c810b09e326","target":"record","created_at":"2026-05-18T01:15:51Z","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":"149b0dbee54d9d1e1d16ce2ed8b5cafa92c5912b0a136e5dd9b639abf4665c98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-20T14:21:44Z","title_canon_sha256":"9eff0d41b31eded12deaff0864cb07fbd2869669d0b1341636f803a7c4569468"},"schema_version":"1.0","source":{"id":"1511.06606","kind":"arxiv","version":5}},"canonical_sha256":"58d5eb2b6e63d76d3c4c8c3e0acbfdc45e1c8725b751859330938f6425fb237b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58d5eb2b6e63d76d3c4c8c3e0acbfdc45e1c8725b751859330938f6425fb237b","first_computed_at":"2026-05-18T01:15:51.943998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:51.943998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wwbFdTCiOPyCPf9bYGPA9t7bcLEcH4blFvDYI3sX3uNvRSBx2SIPRB0OXW/dImFzSy4+rWxVryyOjbsDPn9lDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:51.944581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06606","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab5e5adf66140aab00ccf11f8ece40c98aa7018cb4443926485a9c810b09e326","sha256:0199a16aa665dde8d01e0c5740af5acba6c35a576aee581d540ac2673bc89389"],"state_sha256":"34a6828bf19f23c4c860b14a77ab7fe253ed2acdb81ed32103b9d49a18c1727e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vivjyXR3naFO81R+izQAEy/W2wtn5ajdO4Ui/DB2EPemO5EJM+LWgTkds6RPNP64SYj6hdB1habKyRke9xmWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:52:09.051063Z","bundle_sha256":"ebc3451f7a60fdeb8adb9b5c82a6065f6912df622277495de2cb23afd64484f1"}}