{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UZQ47YVFKD6ATUML5Y2EW35I4K","short_pith_number":"pith:UZQ47YVF","schema_version":"1.0","canonical_sha256":"a661cfe2a550fc09d18bee344b6fa8e290ccaafac1432f3ea8fa2dee0b7f3c6d","source":{"kind":"arxiv","id":"2203.12555","version":3},"attestation_state":"computed","paper":{"title":"GriTS: Grid table similarity metric for table structure recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Brandon Smock, Robin Abraham, Rohith Pesala","submitted_at":"2022-03-23T17:14:03Z","abstract_excerpt":"In this paper, we propose a new class of metric for table structure recognition (TSR) evaluation, called grid table similarity (GriTS). Unlike prior metrics, GriTS evaluates the correctness of a predicted table directly in its natural form as a matrix. To create a similarity measure between matrices, we generalize the two-dimensional largest common substructure (2D-LCS) problem, which is NP-hard, to the 2D most similar substructures (2D-MSS) problem and propose a polynomial-time heuristic for solving it. This algorithm produces both an upper and a lower bound on the true similarity between mat"},"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":"2203.12555","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-23T17:14:03Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"428408d24140a492df627558365798678a7dce9e7de20f8366de9fcc7dd5dd5c","abstract_canon_sha256":"06c8af6baca94833affce3b764cc5fab57d57711993762dd3b743cbdfaf7cc29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:14.864459Z","signature_b64":"m4D6J6TxWfsAhfXC3eCBSjeGrJ/K4QPQT35A5uCUKOOlnAzuHQ8KfKHTEZr0yhMoIyl+yeQyUiVkLjhc5meGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a661cfe2a550fc09d18bee344b6fa8e290ccaafac1432f3ea8fa2dee0b7f3c6d","last_reissued_at":"2026-07-05T06:13:14.864081Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:14.864081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GriTS: Grid table similarity metric for table structure recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Brandon Smock, Robin Abraham, Rohith Pesala","submitted_at":"2022-03-23T17:14:03Z","abstract_excerpt":"In this paper, we propose a new class of metric for table structure recognition (TSR) evaluation, called grid table similarity (GriTS). Unlike prior metrics, GriTS evaluates the correctness of a predicted table directly in its natural form as a matrix. To create a similarity measure between matrices, we generalize the two-dimensional largest common substructure (2D-LCS) problem, which is NP-hard, to the 2D most similar substructures (2D-MSS) problem and propose a polynomial-time heuristic for solving it. This algorithm produces both an upper and a lower bound on the true similarity between mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.12555","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.12555/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":"2203.12555","created_at":"2026-07-05T06:13:14.864136+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.12555v3","created_at":"2026-07-05T06:13:14.864136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.12555","created_at":"2026-07-05T06:13:14.864136+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZQ47YVFKD6A","created_at":"2026-07-05T06:13:14.864136+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZQ47YVFKD6ATUML","created_at":"2026-07-05T06:13:14.864136+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZQ47YVF","created_at":"2026-07-05T06:13:14.864136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21005","citing_title":"Building Agent Harnesses for Scientific Curation from Multimodal Sources","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18721","citing_title":"Rethinking the Pointer Loss in Table Structure Recognition: Geometry-Aware Pointer Loss for Spatial Locality","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2412.03555","citing_title":"PaliGemma 2: A Family of Versatile VLMs for Transfer","ref_index":86,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08538","citing_title":"ParseBench: A Document Parsing Benchmark for AI Agents","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16099","citing_title":"DenTab: A Dataset for Table Recognition and Visual QA on Real-World Dental Estimates","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K","json":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K.json","graph_json":"https://pith.science/api/pith-number/UZQ47YVFKD6ATUML5Y2EW35I4K/graph.json","events_json":"https://pith.science/api/pith-number/UZQ47YVFKD6ATUML5Y2EW35I4K/events.json","paper":"https://pith.science/paper/UZQ47YVF"},"agent_actions":{"view_html":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K","download_json":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K.json","view_paper":"https://pith.science/paper/UZQ47YVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.12555&json=true","fetch_graph":"https://pith.science/api/pith-number/UZQ47YVFKD6ATUML5Y2EW35I4K/graph.json","fetch_events":"https://pith.science/api/pith-number/UZQ47YVFKD6ATUML5Y2EW35I4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K/action/storage_attestation","attest_author":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K/action/author_attestation","sign_citation":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K/action/citation_signature","submit_replication":"https://pith.science/pith/UZQ47YVFKD6ATUML5Y2EW35I4K/action/replication_record"}},"created_at":"2026-07-05T06:13:14.864136+00:00","updated_at":"2026-07-05T06:13:14.864136+00:00"}