{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KIMXIZDIJ37KMMOCAKBIMPJDXB","short_pith_number":"pith:KIMXIZDI","canonical_record":{"source":{"id":"1107.1322","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-07T09:09:19Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"2d0b9712aa7796810df0a59d2610b0758063682621db94b9afc1fcac198751d8","abstract_canon_sha256":"d0b494cb466a65e14b3959e117bffe572b8529eb581868729e017ae4f99ba496"},"schema_version":"1.0"},"canonical_sha256":"52197464684efea631c20282863d23b863f720db80c097b775f93e8087c2216a","source":{"kind":"arxiv","id":"1107.1322","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1322","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1322v3","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1322","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"KIMXIZDIJ37K","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KIMXIZDIJ37KMMOC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KIMXIZDI","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KIMXIZDIJ37KMMOCAKBIMPJDXB","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1322","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-07T09:09:19Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"2d0b9712aa7796810df0a59d2610b0758063682621db94b9afc1fcac198751d8","abstract_canon_sha256":"d0b494cb466a65e14b3959e117bffe572b8529eb581868729e017ae4f99ba496"},"schema_version":"1.0"},"canonical_sha256":"52197464684efea631c20282863d23b863f720db80c097b775f93e8087c2216a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.442409Z","signature_b64":"Rx4A5VH9JZVR7Kgon0V9FieVipxCBbCdlVsnzPB2xAcIiYSDrL8T3Ofo/WG4BMedLChxs6dhFrOyl32PZwTZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52197464684efea631c20282863d23b863f720db80c097b775f93e8087c2216a","last_reissued_at":"2026-05-18T02:21:43.441958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.441958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1322","source_version":3,"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:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLTBVNLDgL26apOqPZruyquTuMm/GymsJDIR2POhBQ1vikVsFoTn81+BB7xMPP0knqXnqvd7oij4zPrtLqBNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:20:07.370205Z"},"content_sha256":"d38e96e439bc307dc2b2749b789d917a9ec650b9c5fc795124b63ace87cd8a78","schema_version":"1.0","event_id":"sha256:d38e96e439bc307dc2b2749b789d917a9ec650b9c5fc795124b63ace87cd8a78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KIMXIZDIJ37KMMOCAKBIMPJDXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Text Classification: A Sequential Reading Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Gabriel Dulac-Arnold, Ludovic Denoyer, Patrick Gallinari","submitted_at":"2011-07-07T09:09:19Z","abstract_excerpt":"We propose to model the text classification process as a sequential decision process. In this process, an agent learns to classify documents into topics while reading the document sentences sequentially and learns to stop as soon as enough information was read for deciding. The proposed algorithm is based on a modelisation of Text Classification as a Markov Decision Process and learns by using Reinforcement Learning. Experiments on four different classical mono-label corpora show that the proposed approach performs comparably to classical SVM approaches for large training sets, and better for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1322","kind":"arxiv","version":3},"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:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2LWxGO2C1gg9TfbVhjcfgsfOEXJw8B951+O80HIOlMm01gTDCj/JM72mIgOJz4j7FONhqTJUS1py/V8gbn7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:20:07.370869Z"},"content_sha256":"a0b960a79a8f9b80e512dc9e4aafe844274b0f07e0fd7365cb4e6987db1c17e9","schema_version":"1.0","event_id":"sha256:a0b960a79a8f9b80e512dc9e4aafe844274b0f07e0fd7365cb4e6987db1c17e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIMXIZDIJ37KMMOCAKBIMPJDXB/bundle.json","state_url":"https://pith.science/pith/KIMXIZDIJ37KMMOCAKBIMPJDXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIMXIZDIJ37KMMOCAKBIMPJDXB/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-29T19:20:07Z","links":{"resolver":"https://pith.science/pith/KIMXIZDIJ37KMMOCAKBIMPJDXB","bundle":"https://pith.science/pith/KIMXIZDIJ37KMMOCAKBIMPJDXB/bundle.json","state":"https://pith.science/pith/KIMXIZDIJ37KMMOCAKBIMPJDXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIMXIZDIJ37KMMOCAKBIMPJDXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KIMXIZDIJ37KMMOCAKBIMPJDXB","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":"d0b494cb466a65e14b3959e117bffe572b8529eb581868729e017ae4f99ba496","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-07T09:09:19Z","title_canon_sha256":"2d0b9712aa7796810df0a59d2610b0758063682621db94b9afc1fcac198751d8"},"schema_version":"1.0","source":{"id":"1107.1322","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1322","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1322v3","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1322","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"KIMXIZDIJ37K","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KIMXIZDIJ37KMMOC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KIMXIZDI","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:a0b960a79a8f9b80e512dc9e4aafe844274b0f07e0fd7365cb4e6987db1c17e9","target":"graph","created_at":"2026-05-18T02:21:43Z","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 to model the text classification process as a sequential decision process. In this process, an agent learns to classify documents into topics while reading the document sentences sequentially and learns to stop as soon as enough information was read for deciding. The proposed algorithm is based on a modelisation of Text Classification as a Markov Decision Process and learns by using Reinforcement Learning. Experiments on four different classical mono-label corpora show that the proposed approach performs comparably to classical SVM approaches for large training sets, and better for ","authors_text":"Gabriel Dulac-Arnold, Ludovic Denoyer, Patrick Gallinari","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-07T09:09:19Z","title":"Text Classification: A Sequential Reading Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1322","kind":"arxiv","version":3},"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:d38e96e439bc307dc2b2749b789d917a9ec650b9c5fc795124b63ace87cd8a78","target":"record","created_at":"2026-05-18T02:21:43Z","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":"d0b494cb466a65e14b3959e117bffe572b8529eb581868729e017ae4f99ba496","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-07T09:09:19Z","title_canon_sha256":"2d0b9712aa7796810df0a59d2610b0758063682621db94b9afc1fcac198751d8"},"schema_version":"1.0","source":{"id":"1107.1322","kind":"arxiv","version":3}},"canonical_sha256":"52197464684efea631c20282863d23b863f720db80c097b775f93e8087c2216a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52197464684efea631c20282863d23b863f720db80c097b775f93e8087c2216a","first_computed_at":"2026-05-18T02:21:43.441958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:43.441958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rx4A5VH9JZVR7Kgon0V9FieVipxCBbCdlVsnzPB2xAcIiYSDrL8T3Ofo/WG4BMedLChxs6dhFrOyl32PZwTZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:43.442409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1322","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d38e96e439bc307dc2b2749b789d917a9ec650b9c5fc795124b63ace87cd8a78","sha256:a0b960a79a8f9b80e512dc9e4aafe844274b0f07e0fd7365cb4e6987db1c17e9"],"state_sha256":"41b1778cd261c4ab96f4f3405632aaf4aead3d09aee78b2a0f1a777fa9324263"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QI7C8zN8DYIxvA7XThGGofjSxLoUvz18RiknMzagLPESkTBiHAIHIC0qfQlf+5+c7TI6JDuskyyEtzeKoCMHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:20:07.374186Z","bundle_sha256":"184da67195348732d2e36f5fd0c28fd85ee640ea0e972d306574ee4f967adbaa"}}