{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TZHRLRHM7ZLLPXG25DZ7FWHXQN","short_pith_number":"pith:TZHRLRHM","schema_version":"1.0","canonical_sha256":"9e4f15c4ecfe56b7dcdae8f3f2d8f78366540c13e33d9a1e376f5e99f3157e88","source":{"kind":"arxiv","id":"2206.04045","version":2},"attestation_state":"computed","paper":{"title":"STable: Table Generation Framework for Encoder-Decoder Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Dawid Jurkiewicz, Gabriela Pa{\\l}ka, Karolina Szyndler, {\\L}ukasz Borchmann, {\\L}ukasz Garncarek, Micha{\\l} Pietruszka, Micha{\\l} Turski, Tomasz Dwojak","submitted_at":"2022-06-08T17:59:02Z","abstract_excerpt":"The output structure of database-like tables, consisting of values structured in horizontal rows and vertical columns identifiable by name, can cover a wide range of NLP tasks. Following this constatation, we propose a framework for text-to-table neural models applicable to problems such as extraction of line items, joint entity and relation extraction, or knowledge base population. The permutation-based decoder of our proposal is a generalized sequential method that comprehends information from all cells in the table. The training maximizes the expected log-likelihood for a table's content ac"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2206.04045","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2022-06-08T17:59:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"253ca95a8be4295f37802a33afb00683f24ef18d0c3bc9abc22540c2dc922e98","abstract_canon_sha256":"22bcdbfef5ef2152ce0597305b98a108870cd00efc1bc05ef7fe031e54d716e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:48.230445Z","signature_b64":"A/C+jasEQVI0Xlx9ACvtAtLhdNEgivIUVazQ/3jbT/X04Eug8+H4cml22OhTCkgZ3sa6IhUapJnAnASvF29HCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e4f15c4ecfe56b7dcdae8f3f2d8f78366540c13e33d9a1e376f5e99f3157e88","last_reissued_at":"2026-07-05T05:05:48.229873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:48.229873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"STable: Table Generation Framework for Encoder-Decoder Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Dawid Jurkiewicz, Gabriela Pa{\\l}ka, Karolina Szyndler, {\\L}ukasz Borchmann, {\\L}ukasz Garncarek, Micha{\\l} Pietruszka, Micha{\\l} Turski, Tomasz Dwojak","submitted_at":"2022-06-08T17:59:02Z","abstract_excerpt":"The output structure of database-like tables, consisting of values structured in horizontal rows and vertical columns identifiable by name, can cover a wide range of NLP tasks. Following this constatation, we propose a framework for text-to-table neural models applicable to problems such as extraction of line items, joint entity and relation extraction, or knowledge base population. The permutation-based decoder of our proposal is a generalized sequential method that comprehends information from all cells in the table. The training maximizes the expected log-likelihood for a table's content ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.04045","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.04045/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.04045","created_at":"2026-07-05T05:05:48.229934+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.04045v2","created_at":"2026-07-05T05:05:48.229934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.04045","created_at":"2026-07-05T05:05:48.229934+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZHRLRHM7ZLL","created_at":"2026-07-05T05:05:48.229934+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZHRLRHM7ZLLPXG2","created_at":"2026-07-05T05:05:48.229934+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZHRLRHM","created_at":"2026-07-05T05:05:48.229934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06515","citing_title":"QUEST: Query Optimization in Unstructured Document Analysis","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN","json":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN.json","graph_json":"https://pith.science/api/pith-number/TZHRLRHM7ZLLPXG25DZ7FWHXQN/graph.json","events_json":"https://pith.science/api/pith-number/TZHRLRHM7ZLLPXG25DZ7FWHXQN/events.json","paper":"https://pith.science/paper/TZHRLRHM"},"agent_actions":{"view_html":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN","download_json":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN.json","view_paper":"https://pith.science/paper/TZHRLRHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.04045&json=true","fetch_graph":"https://pith.science/api/pith-number/TZHRLRHM7ZLLPXG25DZ7FWHXQN/graph.json","fetch_events":"https://pith.science/api/pith-number/TZHRLRHM7ZLLPXG25DZ7FWHXQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN/action/storage_attestation","attest_author":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN/action/author_attestation","sign_citation":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN/action/citation_signature","submit_replication":"https://pith.science/pith/TZHRLRHM7ZLLPXG25DZ7FWHXQN/action/replication_record"}},"created_at":"2026-07-05T05:05:48.229934+00:00","updated_at":"2026-07-05T05:05:48.229934+00:00"}