{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GQ3RSYYBVUWC7Z642UCFRV7ZK7","short_pith_number":"pith:GQ3RSYYB","schema_version":"1.0","canonical_sha256":"3437196301ad2c2fe7dcd50458d7f957f39c13048040f8070847ae41497ba0b8","source":{"kind":"arxiv","id":"1610.02504","version":2},"attestation_state":"computed","paper":{"title":"Minimizing the sum of projections of a finite set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG","math.NT"],"primary_cat":"math.CO","authors_text":"Misha Rudnev, Vsevolod F. Lev","submitted_at":"2016-10-08T09:19:27Z","abstract_excerpt":"Consider the projections of a finite set $A\\subset R^n$ onto the coordinate hyperplanes. How small can the sum of the sizes of these projections be, given the size of $A$? In a different form, this problem has been studied earlier in the context of edge-isoperimetric inequalities on graphs, and it is can be derived from the known results that there is a linear order on the set of $n$-tuples with non-negative integer coordinates, such that the sum in question is minimised for the initial segments with respect to this order. We present a new, self-contained and constructive proof, enabling us to"},"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":"1610.02504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-08T09:19:27Z","cross_cats_sorted":["math.MG","math.NT"],"title_canon_sha256":"4c85debde07b9d684fed8135f8995b5020ccb350e79064e1ca101969f4866f4c","abstract_canon_sha256":"eb0af3ba3dc23d2792bdb9a7aea7f335e60a4e2ed39ee4cdff68b24ff5793ebd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:52.385753Z","signature_b64":"h0KeS3azPrM/lfFE2MiHTb0YiJpXXrwToP6N4U2SDYr2/cSO+kdw3v/bx5+42h1/d2O1O96BbaZH5pq56sq8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3437196301ad2c2fe7dcd50458d7f957f39c13048040f8070847ae41497ba0b8","last_reissued_at":"2026-05-18T01:00:52.385146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:52.385146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing the sum of projections of a finite set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG","math.NT"],"primary_cat":"math.CO","authors_text":"Misha Rudnev, Vsevolod F. Lev","submitted_at":"2016-10-08T09:19:27Z","abstract_excerpt":"Consider the projections of a finite set $A\\subset R^n$ onto the coordinate hyperplanes. How small can the sum of the sizes of these projections be, given the size of $A$? In a different form, this problem has been studied earlier in the context of edge-isoperimetric inequalities on graphs, and it is can be derived from the known results that there is a linear order on the set of $n$-tuples with non-negative integer coordinates, such that the sum in question is minimised for the initial segments with respect to this order. We present a new, self-contained and constructive proof, enabling us to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02504","kind":"arxiv","version":2},"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":"1610.02504","created_at":"2026-05-18T01:00:52.385238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02504v2","created_at":"2026-05-18T01:00:52.385238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02504","created_at":"2026-05-18T01:00:52.385238+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQ3RSYYBVUWC","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQ3RSYYBVUWC7Z64","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQ3RSYYB","created_at":"2026-05-18T12:30:19.053100+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/GQ3RSYYBVUWC7Z642UCFRV7ZK7","json":"https://pith.science/pith/GQ3RSYYBVUWC7Z642UCFRV7ZK7.json","graph_json":"https://pith.science/api/pith-number/GQ3RSYYBVUWC7Z642UCFRV7ZK7/graph.json","events_json":"https://pith.science/api/pith-number/GQ3RSYYBVUWC7Z642UCFRV7ZK7/events.json","paper":"https://pith.science/paper/GQ3RSYYB"},"agent_actions":{"view_html":"https://pith.science/pith/GQ3RSYYBVUWC7Z642UCFRV7ZK7","download_json":"https://pith.science/pith/GQ3RSYYBVUWC7Z642UCFRV7ZK7.json","view_paper":"https://pith.science/paper/GQ3RSYYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02504&json=true","fetch_graph":"https://pith.science/api/pith-number/GQ3RSYYBVUWC7Z642UCFRV7ZK7/graph.json","fetch_events":"https://pith.science/api/pith-number/GQ3RSYYBVUWC7Z642UCFRV7ZK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQ3RSYYBVUWC7Z642UCFRV7ZK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQ3RSYYBVUWC7Z642UCFRV7ZK7/action/storage_attestation","attest_author":"https://pith.science/pith/GQ3RSYYBVUWC7Z642UCFRV7ZK7/action/author_attestation","sign_citation":"https://pith.science/pith/GQ3RSYYBVUWC7Z642UCFRV7ZK7/action/citation_signature","submit_replication":"https://pith.science/pith/GQ3RSYYBVUWC7Z642UCFRV7ZK7/action/replication_record"}},"created_at":"2026-05-18T01:00:52.385238+00:00","updated_at":"2026-05-18T01:00:52.385238+00:00"}