{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WZOSBXWUVR3SYCHBN45KKAQUIT","short_pith_number":"pith:WZOSBXWU","schema_version":"1.0","canonical_sha256":"b65d20ded4ac772c08e16f3aa5021444c151ba072bafb779ebadfc7ae05d878b","source":{"kind":"arxiv","id":"1604.05084","version":2},"attestation_state":"computed","paper":{"title":"On a problem by Shapozenko on Johnson graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Llu\\'is Vena, Oriol Serra, V\\'ictor Diego","submitted_at":"2016-04-18T11:05:53Z","abstract_excerpt":"The Johnson graph $J(n,m)$ has the $m$--subsets of $\\{1,2,\\ldots,n\\}$ as vertices and two subsets are adjacent in the graph if they share $m-1$ elements. Shapozenko asked about the isoperimetric function $\\mu_{n,m}(k)$ of Johnson graphs, that is, the cardinality of the smallest boundary of sets with $k$ vertices in $J(n,m)$ for each $1\\le k\\le {n\\choose m}$. We give an upper bound for $\\mu_{n,m}(k)$ and show that, for each given $k$ such that the solution to the Shadow Minimization Problem in the Boolean lattice is unique, and each sufficiently large $n$, the given upper bound is tight. We als"},"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":"1604.05084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-18T11:05:53Z","cross_cats_sorted":[],"title_canon_sha256":"8a3f15f7eb1f985675b2b2d9e0c9aaca5f0a93e68720b9d29013e32f8458f0f3","abstract_canon_sha256":"1ef242bfe2787bf846b4b394a2f8c7fb2e9b388c0b00670d3992cc678e469a04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:07.313571Z","signature_b64":"KIqDGFUWwdOALenhMVWGspM9tZtHTg544+pl8/7V8w6tANQ44Imaq0Bv3fkBHXEMavSjuWUvvaSosJIFhB7iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b65d20ded4ac772c08e16f3aa5021444c151ba072bafb779ebadfc7ae05d878b","last_reissued_at":"2026-05-18T00:51:07.313042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:07.313042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a problem by Shapozenko on Johnson graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Llu\\'is Vena, Oriol Serra, V\\'ictor Diego","submitted_at":"2016-04-18T11:05:53Z","abstract_excerpt":"The Johnson graph $J(n,m)$ has the $m$--subsets of $\\{1,2,\\ldots,n\\}$ as vertices and two subsets are adjacent in the graph if they share $m-1$ elements. Shapozenko asked about the isoperimetric function $\\mu_{n,m}(k)$ of Johnson graphs, that is, the cardinality of the smallest boundary of sets with $k$ vertices in $J(n,m)$ for each $1\\le k\\le {n\\choose m}$. We give an upper bound for $\\mu_{n,m}(k)$ and show that, for each given $k$ such that the solution to the Shadow Minimization Problem in the Boolean lattice is unique, and each sufficiently large $n$, the given upper bound is tight. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05084","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":"1604.05084","created_at":"2026-05-18T00:51:07.313132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05084v2","created_at":"2026-05-18T00:51:07.313132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05084","created_at":"2026-05-18T00:51:07.313132+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZOSBXWUVR3S","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZOSBXWUVR3SYCHB","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZOSBXWU","created_at":"2026-05-18T12:30:51.357362+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/WZOSBXWUVR3SYCHBN45KKAQUIT","json":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT.json","graph_json":"https://pith.science/api/pith-number/WZOSBXWUVR3SYCHBN45KKAQUIT/graph.json","events_json":"https://pith.science/api/pith-number/WZOSBXWUVR3SYCHBN45KKAQUIT/events.json","paper":"https://pith.science/paper/WZOSBXWU"},"agent_actions":{"view_html":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT","download_json":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT.json","view_paper":"https://pith.science/paper/WZOSBXWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05084&json=true","fetch_graph":"https://pith.science/api/pith-number/WZOSBXWUVR3SYCHBN45KKAQUIT/graph.json","fetch_events":"https://pith.science/api/pith-number/WZOSBXWUVR3SYCHBN45KKAQUIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/action/storage_attestation","attest_author":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/action/author_attestation","sign_citation":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/action/citation_signature","submit_replication":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/action/replication_record"}},"created_at":"2026-05-18T00:51:07.313132+00:00","updated_at":"2026-05-18T00:51:07.313132+00:00"}