{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:F3G4D7IG2DREBFUU5YQ46Z5E7G","short_pith_number":"pith:F3G4D7IG","schema_version":"1.0","canonical_sha256":"2ecdc1fd06d0e2409694ee21cf67a4f99e1170e59b1aace861a30abe0d987b7c","source":{"kind":"arxiv","id":"1109.6693","version":1},"attestation_state":"computed","paper":{"title":"Depth in Bingo Closure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Bowman Light, Jeffrey Beyerl, Robert E. Jamison","submitted_at":"2011-09-29T23:11:29Z","abstract_excerpt":"Bingo is played on a $5\\times 5$ grid. Take the 25 squares to be the ground set of a closure system in which square $s$ is dependent on a set $S$ of squares iff $s$ completes a line - a row, column, or diagonal - with squares that are already in $S$. The closure of a set $S$ is obtained via an iterative process in which, at each stage, the squares dependent upon the current state are added. In this paper we establish for the $n \\times n$ Bingo board the maximum number of steps required in this closure process."},"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":"1109.6693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-29T23:11:29Z","cross_cats_sorted":[],"title_canon_sha256":"1d2125e31c00adcab936d578f81680b4758d51d1db9a89aadcc1cc350d5f5d69","abstract_canon_sha256":"2ac995d071ca848fa10f8c2af8a1c10d3c58cc0f3c54426dc1f6f0cce643e6ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:52.661724Z","signature_b64":"rIGXXEfjcceZigBwmyj/oq51UFVddJMBRTJ9/w4RniqdmLxKrMw42c8mRDJAzlNpkgnYx5goMa69EINy9RqSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ecdc1fd06d0e2409694ee21cf67a4f99e1170e59b1aace861a30abe0d987b7c","last_reissued_at":"2026-05-18T04:11:52.661197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:52.661197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth in Bingo Closure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Bowman Light, Jeffrey Beyerl, Robert E. Jamison","submitted_at":"2011-09-29T23:11:29Z","abstract_excerpt":"Bingo is played on a $5\\times 5$ grid. Take the 25 squares to be the ground set of a closure system in which square $s$ is dependent on a set $S$ of squares iff $s$ completes a line - a row, column, or diagonal - with squares that are already in $S$. The closure of a set $S$ is obtained via an iterative process in which, at each stage, the squares dependent upon the current state are added. In this paper we establish for the $n \\times n$ Bingo board the maximum number of steps required in this closure process."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6693","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":"1109.6693","created_at":"2026-05-18T04:11:52.661272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6693v1","created_at":"2026-05-18T04:11:52.661272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6693","created_at":"2026-05-18T04:11:52.661272+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3G4D7IG2DRE","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3G4D7IG2DREBFUU","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3G4D7IG","created_at":"2026-05-18T12:26:28.662955+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/F3G4D7IG2DREBFUU5YQ46Z5E7G","json":"https://pith.science/pith/F3G4D7IG2DREBFUU5YQ46Z5E7G.json","graph_json":"https://pith.science/api/pith-number/F3G4D7IG2DREBFUU5YQ46Z5E7G/graph.json","events_json":"https://pith.science/api/pith-number/F3G4D7IG2DREBFUU5YQ46Z5E7G/events.json","paper":"https://pith.science/paper/F3G4D7IG"},"agent_actions":{"view_html":"https://pith.science/pith/F3G4D7IG2DREBFUU5YQ46Z5E7G","download_json":"https://pith.science/pith/F3G4D7IG2DREBFUU5YQ46Z5E7G.json","view_paper":"https://pith.science/paper/F3G4D7IG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6693&json=true","fetch_graph":"https://pith.science/api/pith-number/F3G4D7IG2DREBFUU5YQ46Z5E7G/graph.json","fetch_events":"https://pith.science/api/pith-number/F3G4D7IG2DREBFUU5YQ46Z5E7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3G4D7IG2DREBFUU5YQ46Z5E7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3G4D7IG2DREBFUU5YQ46Z5E7G/action/storage_attestation","attest_author":"https://pith.science/pith/F3G4D7IG2DREBFUU5YQ46Z5E7G/action/author_attestation","sign_citation":"https://pith.science/pith/F3G4D7IG2DREBFUU5YQ46Z5E7G/action/citation_signature","submit_replication":"https://pith.science/pith/F3G4D7IG2DREBFUU5YQ46Z5E7G/action/replication_record"}},"created_at":"2026-05-18T04:11:52.661272+00:00","updated_at":"2026-05-18T04:11:52.661272+00:00"}