{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TWNMIZM6MDE2AHEXI3OZA3RJRA","short_pith_number":"pith:TWNMIZM6","canonical_record":{"source":{"id":"1403.1349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-03-06T05:24:02Z","cross_cats_sorted":["cs.DL","cs.IR"],"title_canon_sha256":"ca827ee163d076cb1dbe6540134f19cd1c3fb4c9a0d88b3ec7648b08edb81d5e","abstract_canon_sha256":"842130cb89a6fce68baaa521bdb7d3704d0de0f1186538f58d643802ac1fe989"},"schema_version":"1.0"},"canonical_sha256":"9d9ac4659e60c9a01c9746dd906e29883b39fd591519c87229f16112ca160b44","source":{"kind":"arxiv","id":"1403.1349","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1349","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1349v2","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1349","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"TWNMIZM6MDE2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TWNMIZM6MDE2AHEX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TWNMIZM6","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TWNMIZM6MDE2AHEXI3OZA3RJRA","target":"record","payload":{"canonical_record":{"source":{"id":"1403.1349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-03-06T05:24:02Z","cross_cats_sorted":["cs.DL","cs.IR"],"title_canon_sha256":"ca827ee163d076cb1dbe6540134f19cd1c3fb4c9a0d88b3ec7648b08edb81d5e","abstract_canon_sha256":"842130cb89a6fce68baaa521bdb7d3704d0de0f1186538f58d643802ac1fe989"},"schema_version":"1.0"},"canonical_sha256":"9d9ac4659e60c9a01c9746dd906e29883b39fd591519c87229f16112ca160b44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:55.610310Z","signature_b64":"KLsuvM5/j/9rlX9LmozfKQ9ttT75r3jCsw7TriArBg7SsJfK5PGs3QhtCcObuWHBYKBo9HTAS0+wRyuZFpoCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d9ac4659e60c9a01c9746dd906e29883b39fd591519c87229f16112ca160b44","last_reissued_at":"2026-05-18T02:39:55.609869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:55.609869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.1349","source_version":2,"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:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msG2J9s92jgalkVw173vXr9nuB7ScY1oynoZIhIR7rX6ogjhAV2VefwbvdNd6dE4e5bOopjYZxhn2cyTu1MGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:55:10.396729Z"},"content_sha256":"b4cbf8c3ccca5b6da3db61f8bbfb4fb9f3e289e459b97f6f92d0d3f3b31e4384","schema_version":"1.0","event_id":"sha256:b4cbf8c3ccca5b6da3db61f8bbfb4fb9f3e289e459b97f6f92d0d3f3b31e4384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TWNMIZM6MDE2AHEXI3OZA3RJRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Soft Linear Constraints with Application to Citation Field Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DL","cs.IR"],"primary_cat":"cs.CL","authors_text":"Alexandre Passos, Andrew McCallum, David Belanger, Sam Anzaroot","submitted_at":"2014-03-06T05:24:02Z","abstract_excerpt":"Accurately segmenting a citation string into fields for authors, titles, etc. is a challenging task because the output typically obeys various global constraints. Previous work has shown that modeling soft constraints, where the model is encouraged, but not require to obey the constraints, can substantially improve segmentation performance. On the other hand, for imposing hard constraints, dual decomposition is a popular technique for efficient prediction given existing algorithms for unconstrained inference. We extend the technique to perform prediction subject to soft constraints. Moreover, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1349","kind":"arxiv","version":2},"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:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkJ5zkp0+2hTcHFaP3PAegoPrU2XVCXp61QXkhtFmfoavBBoMdRdMuKnRoEvKo2m8dNAkQIjJRH3nXHA2o1IAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:55:10.397085Z"},"content_sha256":"95f7dc2bb22350ced04866ba67ef5fb44f13a62abec54d55f83e8f4cd22654b8","schema_version":"1.0","event_id":"sha256:95f7dc2bb22350ced04866ba67ef5fb44f13a62abec54d55f83e8f4cd22654b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWNMIZM6MDE2AHEXI3OZA3RJRA/bundle.json","state_url":"https://pith.science/pith/TWNMIZM6MDE2AHEXI3OZA3RJRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWNMIZM6MDE2AHEXI3OZA3RJRA/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-27T19:55:10Z","links":{"resolver":"https://pith.science/pith/TWNMIZM6MDE2AHEXI3OZA3RJRA","bundle":"https://pith.science/pith/TWNMIZM6MDE2AHEXI3OZA3RJRA/bundle.json","state":"https://pith.science/pith/TWNMIZM6MDE2AHEXI3OZA3RJRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWNMIZM6MDE2AHEXI3OZA3RJRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TWNMIZM6MDE2AHEXI3OZA3RJRA","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":"842130cb89a6fce68baaa521bdb7d3704d0de0f1186538f58d643802ac1fe989","cross_cats_sorted":["cs.DL","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-03-06T05:24:02Z","title_canon_sha256":"ca827ee163d076cb1dbe6540134f19cd1c3fb4c9a0d88b3ec7648b08edb81d5e"},"schema_version":"1.0","source":{"id":"1403.1349","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1349","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1349v2","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1349","created_at":"2026-05-18T02:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"TWNMIZM6MDE2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TWNMIZM6MDE2AHEX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TWNMIZM6","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:95f7dc2bb22350ced04866ba67ef5fb44f13a62abec54d55f83e8f4cd22654b8","target":"graph","created_at":"2026-05-18T02:39:55Z","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":"Accurately segmenting a citation string into fields for authors, titles, etc. is a challenging task because the output typically obeys various global constraints. Previous work has shown that modeling soft constraints, where the model is encouraged, but not require to obey the constraints, can substantially improve segmentation performance. On the other hand, for imposing hard constraints, dual decomposition is a popular technique for efficient prediction given existing algorithms for unconstrained inference. We extend the technique to perform prediction subject to soft constraints. Moreover, ","authors_text":"Alexandre Passos, Andrew McCallum, David Belanger, Sam Anzaroot","cross_cats":["cs.DL","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-03-06T05:24:02Z","title":"Learning Soft Linear Constraints with Application to Citation Field Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1349","kind":"arxiv","version":2},"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:b4cbf8c3ccca5b6da3db61f8bbfb4fb9f3e289e459b97f6f92d0d3f3b31e4384","target":"record","created_at":"2026-05-18T02:39:55Z","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":"842130cb89a6fce68baaa521bdb7d3704d0de0f1186538f58d643802ac1fe989","cross_cats_sorted":["cs.DL","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-03-06T05:24:02Z","title_canon_sha256":"ca827ee163d076cb1dbe6540134f19cd1c3fb4c9a0d88b3ec7648b08edb81d5e"},"schema_version":"1.0","source":{"id":"1403.1349","kind":"arxiv","version":2}},"canonical_sha256":"9d9ac4659e60c9a01c9746dd906e29883b39fd591519c87229f16112ca160b44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d9ac4659e60c9a01c9746dd906e29883b39fd591519c87229f16112ca160b44","first_computed_at":"2026-05-18T02:39:55.609869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:55.609869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KLsuvM5/j/9rlX9LmozfKQ9ttT75r3jCsw7TriArBg7SsJfK5PGs3QhtCcObuWHBYKBo9HTAS0+wRyuZFpoCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:55.610310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1349","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4cbf8c3ccca5b6da3db61f8bbfb4fb9f3e289e459b97f6f92d0d3f3b31e4384","sha256:95f7dc2bb22350ced04866ba67ef5fb44f13a62abec54d55f83e8f4cd22654b8"],"state_sha256":"fd0374c056c4f7a95d4f7b5bc9bfdc43bd770cfb7b456c50fa605303d39117c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96jWCz9UyAhP088EvIOeBgdCKxIjxfmRum5ebBQqoRbGV3Gs9p2cwESo/mCPyYWrWqtHIzU24093aZENmMoRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:55:10.399860Z","bundle_sha256":"16cfec874583e072fa172d5c3f9188281037368dd4747386f00b50a779d83064"}}