{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IJK37EWNZ4U46BH3EW5K3ZMHSF","short_pith_number":"pith:IJK37EWN","schema_version":"1.0","canonical_sha256":"4255bf92cdcf29cf04fb25baade5879144189b8ea12707d854ba62d8368af5af","source":{"kind":"arxiv","id":"1409.5922","version":1},"attestation_state":"computed","paper":{"title":"Automated Discharging Arguments for Density Problems in Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Derrick Stolee","submitted_at":"2014-09-20T22:02:08Z","abstract_excerpt":"Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an identifying code in the hexagonal grid remains open, with an upper bound of $\\frac{3}{7} \\approx 0.428571$ and a lower bound of $\\frac{5}{12}\\approx 0.416666$. We present a new, experimental framework for producing discharging arguments using an algorithm. This algorithm replaces the lengthy case analysis of human-written discharging arguments with a linear progra"},"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":"1409.5922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-20T22:02:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5da46170d62b472b5f75c88a13e66044368c09ac5df42b07e83d9823f0172db5","abstract_canon_sha256":"81f19896def5f39b3df1ea5b409dd6ab2c5549f34755be7153dd4d2cf4606e40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:14.135886Z","signature_b64":"a9n0N1klEdEHC8rNIPmldSsjzQ2ari0xjDmy8XbGsrVHNp7d8487ugMqyg79WfpWHYQDuuIhfvzc1gWyWxtTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4255bf92cdcf29cf04fb25baade5879144189b8ea12707d854ba62d8368af5af","last_reissued_at":"2026-05-18T02:42:14.135463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:14.135463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Discharging Arguments for Density Problems in Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Derrick Stolee","submitted_at":"2014-09-20T22:02:08Z","abstract_excerpt":"Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an identifying code in the hexagonal grid remains open, with an upper bound of $\\frac{3}{7} \\approx 0.428571$ and a lower bound of $\\frac{5}{12}\\approx 0.416666$. We present a new, experimental framework for producing discharging arguments using an algorithm. This algorithm replaces the lengthy case analysis of human-written discharging arguments with a linear progra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5922","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":"1409.5922","created_at":"2026-05-18T02:42:14.135528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5922v1","created_at":"2026-05-18T02:42:14.135528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5922","created_at":"2026-05-18T02:42:14.135528+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJK37EWNZ4U4","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJK37EWNZ4U46BH3","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJK37EWN","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2303.00557","citing_title":"Finding codes on infinite grids automatically","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2402.08264","citing_title":"On Iiro Honkala's contributions to identifying codes","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF","json":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF.json","graph_json":"https://pith.science/api/pith-number/IJK37EWNZ4U46BH3EW5K3ZMHSF/graph.json","events_json":"https://pith.science/api/pith-number/IJK37EWNZ4U46BH3EW5K3ZMHSF/events.json","paper":"https://pith.science/paper/IJK37EWN"},"agent_actions":{"view_html":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF","download_json":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF.json","view_paper":"https://pith.science/paper/IJK37EWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5922&json=true","fetch_graph":"https://pith.science/api/pith-number/IJK37EWNZ4U46BH3EW5K3ZMHSF/graph.json","fetch_events":"https://pith.science/api/pith-number/IJK37EWNZ4U46BH3EW5K3ZMHSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF/action/storage_attestation","attest_author":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF/action/author_attestation","sign_citation":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF/action/citation_signature","submit_replication":"https://pith.science/pith/IJK37EWNZ4U46BH3EW5K3ZMHSF/action/replication_record"}},"created_at":"2026-05-18T02:42:14.135528+00:00","updated_at":"2026-05-18T02:42:14.135528+00:00"}