{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DKJNNAYNPUTWGEZDIGGHBXT2C4","short_pith_number":"pith:DKJNNAYN","schema_version":"1.0","canonical_sha256":"1a92d6830d7d27631323418c70de7a1737509147c12277f752579d3a351a5342","source":{"kind":"arxiv","id":"1311.3323","version":1},"attestation_state":"computed","paper":{"title":"The opaque square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adrian Dumitrescu, Minghui Jiang","submitted_at":"2013-11-13T22:13:29Z","abstract_excerpt":"The problem of finding small sets that block every line passing through a unit square was first considered by Mazurkiewicz in 1916. We call such a set {\\em opaque} or a {\\em barrier} for the square. The shortest known barrier has length $\\sqrt{2}+ \\frac{\\sqrt{6}}{2}= 2.6389\\ldots$. The current best lower bound for the length of a (not necessarily connected) barrier is $2$, as established by Jones about 50 years ago. No better lower bound is known even if the barrier is restricted to lie in the square or in its close vicinity. Under a suitable locality assumption, we replace this lower bound by"},"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":"1311.3323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T22:13:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e00742eaf6177389e0c49838f4302df22bb8c514583904e0eb604983cadd21d7","abstract_canon_sha256":"7c8d94e74cb7d0842dbbb8c9f66c13b3ef128ee7545b1029688e3de94cc93a25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:11.803185Z","signature_b64":"zBYgH4UKB+sienO45ynSBF1ZGE1HRo21EBr9EPISXV8UoLBdGMQAecVlm8i8cuckvUwBqE7tK5xehlDMstR4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a92d6830d7d27631323418c70de7a1737509147c12277f752579d3a351a5342","last_reissued_at":"2026-05-18T03:07:11.802582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:11.802582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The opaque square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adrian Dumitrescu, Minghui Jiang","submitted_at":"2013-11-13T22:13:29Z","abstract_excerpt":"The problem of finding small sets that block every line passing through a unit square was first considered by Mazurkiewicz in 1916. We call such a set {\\em opaque} or a {\\em barrier} for the square. The shortest known barrier has length $\\sqrt{2}+ \\frac{\\sqrt{6}}{2}= 2.6389\\ldots$. The current best lower bound for the length of a (not necessarily connected) barrier is $2$, as established by Jones about 50 years ago. No better lower bound is known even if the barrier is restricted to lie in the square or in its close vicinity. Under a suitable locality assumption, we replace this lower bound by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3323","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":"1311.3323","created_at":"2026-05-18T03:07:11.802671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3323v1","created_at":"2026-05-18T03:07:11.802671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3323","created_at":"2026-05-18T03:07:11.802671+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKJNNAYNPUTW","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKJNNAYNPUTWGEZD","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKJNNAYN","created_at":"2026-05-18T12:27:43.054852+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/DKJNNAYNPUTWGEZDIGGHBXT2C4","json":"https://pith.science/pith/DKJNNAYNPUTWGEZDIGGHBXT2C4.json","graph_json":"https://pith.science/api/pith-number/DKJNNAYNPUTWGEZDIGGHBXT2C4/graph.json","events_json":"https://pith.science/api/pith-number/DKJNNAYNPUTWGEZDIGGHBXT2C4/events.json","paper":"https://pith.science/paper/DKJNNAYN"},"agent_actions":{"view_html":"https://pith.science/pith/DKJNNAYNPUTWGEZDIGGHBXT2C4","download_json":"https://pith.science/pith/DKJNNAYNPUTWGEZDIGGHBXT2C4.json","view_paper":"https://pith.science/paper/DKJNNAYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3323&json=true","fetch_graph":"https://pith.science/api/pith-number/DKJNNAYNPUTWGEZDIGGHBXT2C4/graph.json","fetch_events":"https://pith.science/api/pith-number/DKJNNAYNPUTWGEZDIGGHBXT2C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKJNNAYNPUTWGEZDIGGHBXT2C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKJNNAYNPUTWGEZDIGGHBXT2C4/action/storage_attestation","attest_author":"https://pith.science/pith/DKJNNAYNPUTWGEZDIGGHBXT2C4/action/author_attestation","sign_citation":"https://pith.science/pith/DKJNNAYNPUTWGEZDIGGHBXT2C4/action/citation_signature","submit_replication":"https://pith.science/pith/DKJNNAYNPUTWGEZDIGGHBXT2C4/action/replication_record"}},"created_at":"2026-05-18T03:07:11.802671+00:00","updated_at":"2026-05-18T03:07:11.802671+00:00"}