{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4WY45HPNA5DUCSMJRDXK2UAL5E","short_pith_number":"pith:4WY45HPN","schema_version":"1.0","canonical_sha256":"e5b1ce9ded074741498988eead500be93bb794f8e57c8e85d2942bf81ca0202a","source":{"kind":"arxiv","id":"1612.09217","version":1},"attestation_state":"computed","paper":{"title":"Cauchy-Davenport Theorem for linear maps: Simplification and Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aditya Potukuchi, John Kim","submitted_at":"2016-12-29T17:55:54Z","abstract_excerpt":"We give a new proof of the Cauchy-Davenport Theorem for linear maps given by Herdade et al., (2015). This theorem gives a lower bound on the size of the image of a linear map on a grid. Our proof is purely combinatorial and offers a partial insight into the range of parameters not handled previously."},"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":"1612.09217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-29T17:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"1349b0f1764b2b8a00f557d8156e9d8b6dc4a9e248ebd99aff8272d3a0262c47","abstract_canon_sha256":"de8452941543ef9ca04753b5b17f49732321af4de76e42689594b376b8afd137"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:46.225412Z","signature_b64":"07YvvIWquB4prCH7GxLjhFhvwaDsa8GcpvY04qarq0OSD7U+WJZPb8pL9I2EeMpMT5r4X63y6kunYfHvet36Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5b1ce9ded074741498988eead500be93bb794f8e57c8e85d2942bf81ca0202a","last_reissued_at":"2026-05-18T00:53:46.225011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:46.225011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cauchy-Davenport Theorem for linear maps: Simplification and Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aditya Potukuchi, John Kim","submitted_at":"2016-12-29T17:55:54Z","abstract_excerpt":"We give a new proof of the Cauchy-Davenport Theorem for linear maps given by Herdade et al., (2015). This theorem gives a lower bound on the size of the image of a linear map on a grid. Our proof is purely combinatorial and offers a partial insight into the range of parameters not handled previously."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09217","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":"1612.09217","created_at":"2026-05-18T00:53:46.225081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.09217v1","created_at":"2026-05-18T00:53:46.225081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09217","created_at":"2026-05-18T00:53:46.225081+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WY45HPNA5DU","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WY45HPNA5DUCSMJ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WY45HPN","created_at":"2026-05-18T12:29:58.707656+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/4WY45HPNA5DUCSMJRDXK2UAL5E","json":"https://pith.science/pith/4WY45HPNA5DUCSMJRDXK2UAL5E.json","graph_json":"https://pith.science/api/pith-number/4WY45HPNA5DUCSMJRDXK2UAL5E/graph.json","events_json":"https://pith.science/api/pith-number/4WY45HPNA5DUCSMJRDXK2UAL5E/events.json","paper":"https://pith.science/paper/4WY45HPN"},"agent_actions":{"view_html":"https://pith.science/pith/4WY45HPNA5DUCSMJRDXK2UAL5E","download_json":"https://pith.science/pith/4WY45HPNA5DUCSMJRDXK2UAL5E.json","view_paper":"https://pith.science/paper/4WY45HPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.09217&json=true","fetch_graph":"https://pith.science/api/pith-number/4WY45HPNA5DUCSMJRDXK2UAL5E/graph.json","fetch_events":"https://pith.science/api/pith-number/4WY45HPNA5DUCSMJRDXK2UAL5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WY45HPNA5DUCSMJRDXK2UAL5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WY45HPNA5DUCSMJRDXK2UAL5E/action/storage_attestation","attest_author":"https://pith.science/pith/4WY45HPNA5DUCSMJRDXK2UAL5E/action/author_attestation","sign_citation":"https://pith.science/pith/4WY45HPNA5DUCSMJRDXK2UAL5E/action/citation_signature","submit_replication":"https://pith.science/pith/4WY45HPNA5DUCSMJRDXK2UAL5E/action/replication_record"}},"created_at":"2026-05-18T00:53:46.225081+00:00","updated_at":"2026-05-18T00:53:46.225081+00:00"}