{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WZOSBXWUVR3SYCHBN45KKAQUIT","short_pith_number":"pith:WZOSBXWU","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"},"canonical_sha256":"b65d20ded4ac772c08e16f3aa5021444c151ba072bafb779ebadfc7ae05d878b","source":{"kind":"arxiv","id":"1604.05084","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05084","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05084v2","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05084","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"WZOSBXWUVR3S","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WZOSBXWUVR3SYCHB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WZOSBXWU","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WZOSBXWUVR3SYCHBN45KKAQUIT","target":"record","payload":{"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"},"canonical_sha256":"b65d20ded4ac772c08e16f3aa5021444c151ba072bafb779ebadfc7ae05d878b","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"},"source_kind":"arxiv","source_id":"1604.05084","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZHHagmIV0m4fDekI0jyZgIA2R8SDNX2T6XVp1EGP3JsPZ90rj0nu+/o4ictDFlJrWRty/4Faz1BSNVd0slcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:50:50.960843Z"},"content_sha256":"2c74255a9f457d19dc77d552266f3e578e153c02958005a6a23ad8acf8c4dfeb","schema_version":"1.0","event_id":"sha256:2c74255a9f457d19dc77d552266f3e578e153c02958005a6a23ad8acf8c4dfeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WZOSBXWUVR3SYCHBN45KKAQUIT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJY6atZ4SWt0ZoedO8DM25j0c4fxTrt5lah/8inAd3suNDIwdJ8b1kYGQVDNI7WflmC6e8JbVDF1A3ddLXV8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:50:50.961399Z"},"content_sha256":"f181fc1518058029d96dc61cd02274d283ed098fe1b52e7c3e2f197d78714a03","schema_version":"1.0","event_id":"sha256:f181fc1518058029d96dc61cd02274d283ed098fe1b52e7c3e2f197d78714a03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/bundle.json","state_url":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T18:50:50Z","links":{"resolver":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT","bundle":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/bundle.json","state":"https://pith.science/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZOSBXWUVR3SYCHBN45KKAQUIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WZOSBXWUVR3SYCHBN45KKAQUIT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1ef242bfe2787bf846b4b394a2f8c7fb2e9b388c0b00670d3992cc678e469a04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-18T11:05:53Z","title_canon_sha256":"8a3f15f7eb1f985675b2b2d9e0c9aaca5f0a93e68720b9d29013e32f8458f0f3"},"schema_version":"1.0","source":{"id":"1604.05084","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05084","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05084v2","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05084","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"WZOSBXWUVR3S","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WZOSBXWUVR3SYCHB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WZOSBXWU","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:f181fc1518058029d96dc61cd02274d283ed098fe1b52e7c3e2f197d78714a03","target":"graph","created_at":"2026-05-18T00:51:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Llu\\'is Vena, Oriol Serra, V\\'ictor Diego","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-18T11:05:53Z","title":"On a problem by Shapozenko on Johnson graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05084","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2c74255a9f457d19dc77d552266f3e578e153c02958005a6a23ad8acf8c4dfeb","target":"record","created_at":"2026-05-18T00:51:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1ef242bfe2787bf846b4b394a2f8c7fb2e9b388c0b00670d3992cc678e469a04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-18T11:05:53Z","title_canon_sha256":"8a3f15f7eb1f985675b2b2d9e0c9aaca5f0a93e68720b9d29013e32f8458f0f3"},"schema_version":"1.0","source":{"id":"1604.05084","kind":"arxiv","version":2}},"canonical_sha256":"b65d20ded4ac772c08e16f3aa5021444c151ba072bafb779ebadfc7ae05d878b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b65d20ded4ac772c08e16f3aa5021444c151ba072bafb779ebadfc7ae05d878b","first_computed_at":"2026-05-18T00:51:07.313042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:07.313042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KIqDGFUWwdOALenhMVWGspM9tZtHTg544+pl8/7V8w6tANQ44Imaq0Bv3fkBHXEMavSjuWUvvaSosJIFhB7iDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:07.313571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05084","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c74255a9f457d19dc77d552266f3e578e153c02958005a6a23ad8acf8c4dfeb","sha256:f181fc1518058029d96dc61cd02274d283ed098fe1b52e7c3e2f197d78714a03"],"state_sha256":"c85033aa4f22858327f913780060b29a03b2d7f9c61516d06341012ec358b6a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8nZFaSfP64E2/lXHhU1y3rpe39aSt3ICD3P9PL8N6k9lpADFbZ82rrK+5nWaouJqWW/gibH4XEGnxr8KpIdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:50:50.965018Z","bundle_sha256":"4fede4681d783215ea8b796e6080794d33b5a834266a360fe2d8871067d29b33"}}