{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SLHIINH4SZPQHYON2HQ2DTKJJS","short_pith_number":"pith:SLHIINH4","canonical_record":{"source":{"id":"2312.03367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-12-06T09:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"c82ef226da9431136b0707c48373f484a4f071b4408c64a5fb4896e7a2fe1420","abstract_canon_sha256":"32c77b7da1446efbc321155132d0c63b1669b330a51828d65a9d1bbe243e79dc"},"schema_version":"1.0"},"canonical_sha256":"92ce8434fc965f03e1cdd1e1a1cd494ca6a93537c9439c39d073b48dd180757e","source":{"kind":"arxiv","id":"2312.03367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.03367","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"arxiv_version","alias_value":"2312.03367v1","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03367","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"pith_short_12","alias_value":"SLHIINH4SZPQ","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"pith_short_16","alias_value":"SLHIINH4SZPQHYON","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"pith_short_8","alias_value":"SLHIINH4","created_at":"2026-07-05T07:21:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SLHIINH4SZPQHYON2HQ2DTKJJS","target":"record","payload":{"canonical_record":{"source":{"id":"2312.03367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-12-06T09:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"c82ef226da9431136b0707c48373f484a4f071b4408c64a5fb4896e7a2fe1420","abstract_canon_sha256":"32c77b7da1446efbc321155132d0c63b1669b330a51828d65a9d1bbe243e79dc"},"schema_version":"1.0"},"canonical_sha256":"92ce8434fc965f03e1cdd1e1a1cd494ca6a93537c9439c39d073b48dd180757e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:02.781141Z","signature_b64":"4Xbe3Zaz2uk1+gl/TjAh8/dMVuyk69HrKWNDwE2t9gwrRvBSdI7COYHtBNYIsbCoIhgg0Q0Hx1lKX5p3fu5eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ce8434fc965f03e1cdd1e1a1cd494ca6a93537c9439c39d073b48dd180757e","last_reissued_at":"2026-07-05T07:21:02.780735Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:02.780735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.03367","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-05T07:21:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkyigqaiNayXNzRn0kK5oea9Rq+kyl+JmjgaFKTOSiXgA68ssZtsy5kEm+0hKsHrjkdxMpX/fDZXbJ18FiJPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T00:58:36.209347Z"},"content_sha256":"525cdc1c21d4751988d678bc8494bbf5a1f6bbda255c1cb9f6cf002950b64bbe","schema_version":"1.0","event_id":"sha256:525cdc1c21d4751988d678bc8494bbf5a1f6bbda255c1cb9f6cf002950b64bbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SLHIINH4SZPQHYON2HQ2DTKJJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lazy-k: Decoding for Constrained Token Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Arthur Hemmer, Jean-Marc Ogier, J\\'er\\^ome Brachat, Micka\\\"el Coustaty, Nicola Bartolo","submitted_at":"2023-12-06T09:08:32Z","abstract_excerpt":"We explore the possibility of improving probabilistic models in structured prediction. Specifically, we combine the models with constrained decoding approaches in the context of token classification for information extraction. The decoding methods search for constraint-satisfying label-assignments while maximizing the total probability. To do this, we evaluate several existing approaches, as well as propose a novel decoding method called Lazy-$k$. Our findings demonstrate that constrained decoding approaches can significantly improve the models' performances, especially when using smaller mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03367","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/2312.03367/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-05T07:21:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuo9vAImb0aTXsIjk/ALsrTHNx61s/wgxA0Fw+/k7b4MgBfFMXk5xalOb/6NvvNdwLtT9ZqUzrTUnuE3/AMGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T00:58:36.210228Z"},"content_sha256":"4c5efaa24f29f81122a448b51ee0a202015e9ad5c21631fc606ad0c43dd5560c","schema_version":"1.0","event_id":"sha256:4c5efaa24f29f81122a448b51ee0a202015e9ad5c21631fc606ad0c43dd5560c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLHIINH4SZPQHYON2HQ2DTKJJS/bundle.json","state_url":"https://pith.science/pith/SLHIINH4SZPQHYON2HQ2DTKJJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLHIINH4SZPQHYON2HQ2DTKJJS/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-08-23T00:58:36Z","links":{"resolver":"https://pith.science/pith/SLHIINH4SZPQHYON2HQ2DTKJJS","bundle":"https://pith.science/pith/SLHIINH4SZPQHYON2HQ2DTKJJS/bundle.json","state":"https://pith.science/pith/SLHIINH4SZPQHYON2HQ2DTKJJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLHIINH4SZPQHYON2HQ2DTKJJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SLHIINH4SZPQHYON2HQ2DTKJJS","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":"32c77b7da1446efbc321155132d0c63b1669b330a51828d65a9d1bbe243e79dc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-12-06T09:08:32Z","title_canon_sha256":"c82ef226da9431136b0707c48373f484a4f071b4408c64a5fb4896e7a2fe1420"},"schema_version":"1.0","source":{"id":"2312.03367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.03367","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"arxiv_version","alias_value":"2312.03367v1","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03367","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"pith_short_12","alias_value":"SLHIINH4SZPQ","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"pith_short_16","alias_value":"SLHIINH4SZPQHYON","created_at":"2026-07-05T07:21:02Z"},{"alias_kind":"pith_short_8","alias_value":"SLHIINH4","created_at":"2026-07-05T07:21:02Z"}],"graph_snapshots":[{"event_id":"sha256:4c5efaa24f29f81122a448b51ee0a202015e9ad5c21631fc606ad0c43dd5560c","target":"graph","created_at":"2026-07-05T07:21:02Z","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/2312.03367/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We explore the possibility of improving probabilistic models in structured prediction. Specifically, we combine the models with constrained decoding approaches in the context of token classification for information extraction. The decoding methods search for constraint-satisfying label-assignments while maximizing the total probability. To do this, we evaluate several existing approaches, as well as propose a novel decoding method called Lazy-$k$. Our findings demonstrate that constrained decoding approaches can significantly improve the models' performances, especially when using smaller mode","authors_text":"Arthur Hemmer, Jean-Marc Ogier, J\\'er\\^ome Brachat, Micka\\\"el Coustaty, Nicola Bartolo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-12-06T09:08:32Z","title":"Lazy-k: Decoding for Constrained Token Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03367","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:525cdc1c21d4751988d678bc8494bbf5a1f6bbda255c1cb9f6cf002950b64bbe","target":"record","created_at":"2026-07-05T07:21:02Z","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":"32c77b7da1446efbc321155132d0c63b1669b330a51828d65a9d1bbe243e79dc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-12-06T09:08:32Z","title_canon_sha256":"c82ef226da9431136b0707c48373f484a4f071b4408c64a5fb4896e7a2fe1420"},"schema_version":"1.0","source":{"id":"2312.03367","kind":"arxiv","version":1}},"canonical_sha256":"92ce8434fc965f03e1cdd1e1a1cd494ca6a93537c9439c39d073b48dd180757e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92ce8434fc965f03e1cdd1e1a1cd494ca6a93537c9439c39d073b48dd180757e","first_computed_at":"2026-07-05T07:21:02.780735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:21:02.780735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Xbe3Zaz2uk1+gl/TjAh8/dMVuyk69HrKWNDwE2t9gwrRvBSdI7COYHtBNYIsbCoIhgg0Q0Hx1lKX5p3fu5eAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:21:02.781141Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.03367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:525cdc1c21d4751988d678bc8494bbf5a1f6bbda255c1cb9f6cf002950b64bbe","sha256:4c5efaa24f29f81122a448b51ee0a202015e9ad5c21631fc606ad0c43dd5560c"],"state_sha256":"2754e3554b226f859d3cade2f42169e9df1c3570cafd9937e5c2b600dd13f811"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U64fpaSfl8NAx6WEuvoX+Cud5lbpU+S/htj0CKb9H+UN19Qb0+7/rE32m1RHSULs6sX1vaLMChA4aVfJttKTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T00:58:36.216443Z","bundle_sha256":"031c54971966ed1154f5c935f0a9101533b8a6deb3a611b5d98548ce1f5877ed"}}