{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2KEFGIC4DJ23LJBOQCTSKPAK6A","short_pith_number":"pith:2KEFGIC4","canonical_record":{"source":{"id":"1804.03683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T18:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"90aad4ab8e7c0a1f578b24a0cd51bdd474d18fb767b9aadc7c542b9b1babdb86","abstract_canon_sha256":"0a12789a276c1ff0267b065f23e31c82ec6c328d6ff4139c1eff931ce7a312a0"},"schema_version":"1.0"},"canonical_sha256":"d28853205c1a75b5a42e80a7253c0af00ff75808c2a8da9f2a79e9cd682dfbc6","source":{"kind":"arxiv","id":"1804.03683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03683","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03683v1","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03683","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"2KEFGIC4DJ23","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2KEFGIC4DJ23LJBO","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2KEFGIC4","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2KEFGIC4DJ23LJBOQCTSKPAK6A","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T18:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"90aad4ab8e7c0a1f578b24a0cd51bdd474d18fb767b9aadc7c542b9b1babdb86","abstract_canon_sha256":"0a12789a276c1ff0267b065f23e31c82ec6c328d6ff4139c1eff931ce7a312a0"},"schema_version":"1.0"},"canonical_sha256":"d28853205c1a75b5a42e80a7253c0af00ff75808c2a8da9f2a79e9cd682dfbc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:45.337721Z","signature_b64":"cwXCwwfR7/rj0G9OYHa+PFM0f8ejezpvziZazHa/2mCzZLqCxJy+gUMNupwjrwFOcLfquvfsrzZ1bw0YrWKfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d28853205c1a75b5a42e80a7253c0af00ff75808c2a8da9f2a79e9cd682dfbc6","last_reissued_at":"2026-05-18T00:18:45.337231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:45.337231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03683","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-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DE4v1ETnH11DoJXiZzBxXiYC4BmlTAWiJuzyN3FWLMP4oXJGMlPN8xHne6XmuBd4N3piMgOHM0PtOhmzeGtyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:00:35.536297Z"},"content_sha256":"4fa15f4776ab9491b47c8676223e7b357ca7e90bdefb042f86ae1bd95e63b826","schema_version":"1.0","event_id":"sha256:4fa15f4776ab9491b47c8676223e7b357ca7e90bdefb042f86ae1bd95e63b826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2KEFGIC4DJ23LJBOQCTSKPAK6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"French Word Recognition through a Quick Survey on Recurrent Neural Networks Using Long-Short Term Memory RNN-LSTM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Saman Sarraf","submitted_at":"2018-04-10T18:41:14Z","abstract_excerpt":"Optical character recognition (OCR) is a fundamental problem in computer vision. Research studies have shown significant progress in classifying printed characters using deep learning-based methods and topologies. Among current algorithms, recurrent neural networks with long-short term memory blocks called RNN-LSTM have provided the highest performance in terms of accuracy rate. Using the top 5,000 French words collected from the internet including all signs and accents, RNN-LSTM models were trained and tested for several cases. Six fonts were used to generate OCR samples and an additional dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03683","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-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYayeKSL37Kh6LQInsZ3jgtAQdntjyEOUaACz8Clld7zDdk2qST5+nRgyX3fZyog0aewNw2bTYqyZmZrq6DsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:00:35.537077Z"},"content_sha256":"3bb15dc6fe20af01ff514867786e8551a765a06b50b85db13a67655afad6346d","schema_version":"1.0","event_id":"sha256:3bb15dc6fe20af01ff514867786e8551a765a06b50b85db13a67655afad6346d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KEFGIC4DJ23LJBOQCTSKPAK6A/bundle.json","state_url":"https://pith.science/pith/2KEFGIC4DJ23LJBOQCTSKPAK6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KEFGIC4DJ23LJBOQCTSKPAK6A/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-30T04:00:35Z","links":{"resolver":"https://pith.science/pith/2KEFGIC4DJ23LJBOQCTSKPAK6A","bundle":"https://pith.science/pith/2KEFGIC4DJ23LJBOQCTSKPAK6A/bundle.json","state":"https://pith.science/pith/2KEFGIC4DJ23LJBOQCTSKPAK6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KEFGIC4DJ23LJBOQCTSKPAK6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2KEFGIC4DJ23LJBOQCTSKPAK6A","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":"0a12789a276c1ff0267b065f23e31c82ec6c328d6ff4139c1eff931ce7a312a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T18:41:14Z","title_canon_sha256":"90aad4ab8e7c0a1f578b24a0cd51bdd474d18fb767b9aadc7c542b9b1babdb86"},"schema_version":"1.0","source":{"id":"1804.03683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03683","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03683v1","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03683","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"2KEFGIC4DJ23","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2KEFGIC4DJ23LJBO","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2KEFGIC4","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:3bb15dc6fe20af01ff514867786e8551a765a06b50b85db13a67655afad6346d","target":"graph","created_at":"2026-05-18T00:18:45Z","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":"Optical character recognition (OCR) is a fundamental problem in computer vision. Research studies have shown significant progress in classifying printed characters using deep learning-based methods and topologies. Among current algorithms, recurrent neural networks with long-short term memory blocks called RNN-LSTM have provided the highest performance in terms of accuracy rate. Using the top 5,000 French words collected from the internet including all signs and accents, RNN-LSTM models were trained and tested for several cases. Six fonts were used to generate OCR samples and an additional dat","authors_text":"Saman Sarraf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T18:41:14Z","title":"French Word Recognition through a Quick Survey on Recurrent Neural Networks Using Long-Short Term Memory RNN-LSTM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03683","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:4fa15f4776ab9491b47c8676223e7b357ca7e90bdefb042f86ae1bd95e63b826","target":"record","created_at":"2026-05-18T00:18:45Z","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":"0a12789a276c1ff0267b065f23e31c82ec6c328d6ff4139c1eff931ce7a312a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-10T18:41:14Z","title_canon_sha256":"90aad4ab8e7c0a1f578b24a0cd51bdd474d18fb767b9aadc7c542b9b1babdb86"},"schema_version":"1.0","source":{"id":"1804.03683","kind":"arxiv","version":1}},"canonical_sha256":"d28853205c1a75b5a42e80a7253c0af00ff75808c2a8da9f2a79e9cd682dfbc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d28853205c1a75b5a42e80a7253c0af00ff75808c2a8da9f2a79e9cd682dfbc6","first_computed_at":"2026-05-18T00:18:45.337231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:45.337231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cwXCwwfR7/rj0G9OYHa+PFM0f8ejezpvziZazHa/2mCzZLqCxJy+gUMNupwjrwFOcLfquvfsrzZ1bw0YrWKfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:45.337721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fa15f4776ab9491b47c8676223e7b357ca7e90bdefb042f86ae1bd95e63b826","sha256:3bb15dc6fe20af01ff514867786e8551a765a06b50b85db13a67655afad6346d"],"state_sha256":"241d47ebdff9b5422f7b3ecf106522cf79b446c2589f6f097b6c2755951fea29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hp4LnS+iw5v3IlEXAOoSr/vQem1LEOlF7mB1r+uzOy8UJrbc1IUISiJDQ6j4Fg6chNT9atP+PcWVQc5GtIyTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T04:00:35.540185Z","bundle_sha256":"d0b3fec426d57897a432889292ed3084a58cd50fdee3a20f491e9669bf3d2e9a"}}