{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UN4JQYOOEUZZWFDUNUU2NCGABP","short_pith_number":"pith:UN4JQYOO","schema_version":"1.0","canonical_sha256":"a3789861ce25339b14746d29a688c00bc8f2a0c20b029099215dbe3b3c447dc2","source":{"kind":"arxiv","id":"1301.5491","version":1},"attestation_state":"computed","paper":{"title":"ChESS - Quick and Robust Detection of Chess-board Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Joan Lasenby, Stuart Bennett","submitted_at":"2013-01-23T13:10:21Z","abstract_excerpt":"Localization of chess-board vertices is a common task in computer vision, underpinning many applications, but relatively little work focusses on designing a specific feature detector that is fast, accurate and robust. In this paper the `Chess-board Extraction by Subtraction and Summation' (ChESS) feature detector, designed to exclusively respond to chess-board vertices, is presented. The method proposed is robust against noise, poor lighting and poor contrast, requires no prior knowledge of the extent of the chess-board pattern, is computationally very efficient, and provides a strength measur"},"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":"1301.5491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-23T13:10:21Z","cross_cats_sorted":[],"title_canon_sha256":"fccbde0cf4786006fb2181d1847087411b6d0750f6fabfcecce61b98039ae5d5","abstract_canon_sha256":"dd384811b6d56e90097f05e649e7559b23c4bb94efb27738cf4377e75a8b70e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:39.611578Z","signature_b64":"IsbgHz4DvZfAU8Cb4PSFWxrvZ4gBqw9o6sSx2Ol4gm0/OuGtTYISMAj1X/1/Z+R/ANTbKznUBnNkgHdqjVW0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3789861ce25339b14746d29a688c00bc8f2a0c20b029099215dbe3b3c447dc2","last_reissued_at":"2026-05-18T03:35:39.610605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:39.610605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ChESS - Quick and Robust Detection of Chess-board Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Joan Lasenby, Stuart Bennett","submitted_at":"2013-01-23T13:10:21Z","abstract_excerpt":"Localization of chess-board vertices is a common task in computer vision, underpinning many applications, but relatively little work focusses on designing a specific feature detector that is fast, accurate and robust. In this paper the `Chess-board Extraction by Subtraction and Summation' (ChESS) feature detector, designed to exclusively respond to chess-board vertices, is presented. The method proposed is robust against noise, poor lighting and poor contrast, requires no prior knowledge of the extent of the chess-board pattern, is computationally very efficient, and provides a strength measur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5491","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":""},"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":"1301.5491","created_at":"2026-05-18T03:35:39.610761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5491v1","created_at":"2026-05-18T03:35:39.610761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5491","created_at":"2026-05-18T03:35:39.610761+00:00"},{"alias_kind":"pith_short_12","alias_value":"UN4JQYOOEUZZ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UN4JQYOOEUZZWFDU","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UN4JQYOO","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP","json":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP.json","graph_json":"https://pith.science/api/pith-number/UN4JQYOOEUZZWFDUNUU2NCGABP/graph.json","events_json":"https://pith.science/api/pith-number/UN4JQYOOEUZZWFDUNUU2NCGABP/events.json","paper":"https://pith.science/paper/UN4JQYOO"},"agent_actions":{"view_html":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP","download_json":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP.json","view_paper":"https://pith.science/paper/UN4JQYOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5491&json=true","fetch_graph":"https://pith.science/api/pith-number/UN4JQYOOEUZZWFDUNUU2NCGABP/graph.json","fetch_events":"https://pith.science/api/pith-number/UN4JQYOOEUZZWFDUNUU2NCGABP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP/action/storage_attestation","attest_author":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP/action/author_attestation","sign_citation":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP/action/citation_signature","submit_replication":"https://pith.science/pith/UN4JQYOOEUZZWFDUNUU2NCGABP/action/replication_record"}},"created_at":"2026-05-18T03:35:39.610761+00:00","updated_at":"2026-05-18T03:35:39.610761+00:00"}