{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AF5EYNSHIVQ4YHKTCHIYWA27DR","short_pith_number":"pith:AF5EYNSH","schema_version":"1.0","canonical_sha256":"017a4c36474561cc1d5311d18b035f1c6a8d4e673480580d19fff5380e3ee8db","source":{"kind":"arxiv","id":"2305.09750","version":1},"attestation_state":"computed","paper":{"title":"ICDAR 2023 Competition on Hierarchical Text Detection and Recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alessandro Bissacco, Dmitry Panteleev, Michalis Raptis, Shangbang Long, Siyang Qin, Yasuhisa Fujii","submitted_at":"2023-05-16T18:56:12Z","abstract_excerpt":"We organize a competition on hierarchical text detection and recognition. The competition is aimed to promote research into deep learning models and systems that can jointly perform text detection and recognition and geometric layout analysis. We present details of the proposed competition organization, including tasks, datasets, evaluations, and schedule. During the competition period (from January 2nd 2023 to April 1st 2023), at least 50 submissions from more than 20 teams were made in the 2 proposed tasks. Considering the number of teams and submissions, we conclude that the HierText compet"},"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":"2305.09750","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-05-16T18:56:12Z","cross_cats_sorted":[],"title_canon_sha256":"2e6772aed2a0b947e1759640a220c3180d8e7ee67331c1517cd04beacadb697a","abstract_canon_sha256":"0475d827723eac60525c0764888db959125f5f5339d3ec0982635f43755849eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:10:53.417128Z","signature_b64":"r6WNlN9RzUfoWs0aTTpuRzb33taB5+/pbbWJio+T3yau7YzheGRYWf2WB+cDA5iV78cUEHZBpWyVaU0Ro0UWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017a4c36474561cc1d5311d18b035f1c6a8d4e673480580d19fff5380e3ee8db","last_reissued_at":"2026-07-05T06:10:53.416650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:10:53.416650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ICDAR 2023 Competition on Hierarchical Text Detection and Recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alessandro Bissacco, Dmitry Panteleev, Michalis Raptis, Shangbang Long, Siyang Qin, Yasuhisa Fujii","submitted_at":"2023-05-16T18:56:12Z","abstract_excerpt":"We organize a competition on hierarchical text detection and recognition. The competition is aimed to promote research into deep learning models and systems that can jointly perform text detection and recognition and geometric layout analysis. We present details of the proposed competition organization, including tasks, datasets, evaluations, and schedule. During the competition period (from January 2nd 2023 to April 1st 2023), at least 50 submissions from more than 20 teams were made in the 2 proposed tasks. Considering the number of teams and submissions, we conclude that the HierText compet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09750","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/2305.09750/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":"2305.09750","created_at":"2026-07-05T06:10:53.416710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.09750v1","created_at":"2026-07-05T06:10:53.416710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09750","created_at":"2026-07-05T06:10:53.416710+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF5EYNSHIVQ4","created_at":"2026-07-05T06:10:53.416710+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF5EYNSHIVQ4YHKT","created_at":"2026-07-05T06:10:53.416710+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF5EYNSH","created_at":"2026-07-05T06:10:53.416710+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06560","citing_title":"Vision as Unified Multimodal Generation","ref_index":120,"is_internal_anchor":true},{"citing_arxiv_id":"2511.16719","citing_title":"SAM 3: Segment Anything with Concepts","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2604.00161","citing_title":"Q-Mask: Query-driven Causal Masks for Text Anchoring in OCR-Oriented Vision-Language Models","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR","json":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR.json","graph_json":"https://pith.science/api/pith-number/AF5EYNSHIVQ4YHKTCHIYWA27DR/graph.json","events_json":"https://pith.science/api/pith-number/AF5EYNSHIVQ4YHKTCHIYWA27DR/events.json","paper":"https://pith.science/paper/AF5EYNSH"},"agent_actions":{"view_html":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR","download_json":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR.json","view_paper":"https://pith.science/paper/AF5EYNSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.09750&json=true","fetch_graph":"https://pith.science/api/pith-number/AF5EYNSHIVQ4YHKTCHIYWA27DR/graph.json","fetch_events":"https://pith.science/api/pith-number/AF5EYNSHIVQ4YHKTCHIYWA27DR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR/action/storage_attestation","attest_author":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR/action/author_attestation","sign_citation":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR/action/citation_signature","submit_replication":"https://pith.science/pith/AF5EYNSHIVQ4YHKTCHIYWA27DR/action/replication_record"}},"created_at":"2026-07-05T06:10:53.416710+00:00","updated_at":"2026-07-05T06:10:53.416710+00:00"}