{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EUJF7PU7I4ELT2R22AO2DHTZD7","short_pith_number":"pith:EUJF7PU7","canonical_record":{"source":{"id":"1512.02973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T18:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"d68c71c263f36dece851ea82597582a6c805d8bf6da67cdef7117767ae024565","abstract_canon_sha256":"3a8f16db127c66ae3a836de00f564ec18974342d7509cfc05187ca8a7b5e3665"},"schema_version":"1.0"},"canonical_sha256":"25125fbe9f4708b9ea3ad01da19e791ffa948b1e53e1d9d53fc425157737ba82","source":{"kind":"arxiv","id":"1512.02973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02973","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02973v1","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02973","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"EUJF7PU7I4EL","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EUJF7PU7I4ELT2R2","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EUJF7PU7","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EUJF7PU7I4ELT2R22AO2DHTZD7","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T18:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"d68c71c263f36dece851ea82597582a6c805d8bf6da67cdef7117767ae024565","abstract_canon_sha256":"3a8f16db127c66ae3a836de00f564ec18974342d7509cfc05187ca8a7b5e3665"},"schema_version":"1.0"},"canonical_sha256":"25125fbe9f4708b9ea3ad01da19e791ffa948b1e53e1d9d53fc425157737ba82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:39.139001Z","signature_b64":"tQF/5XF5GeojWSKjd0ZuOYbnKL9Dvugd8x+9jBMmFuSfEjZIHVXXY/x4vGaeISbO4iYl7Y0Z3ZFlDKVYO9t8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25125fbe9f4708b9ea3ad01da19e791ffa948b1e53e1d9d53fc425157737ba82","last_reissued_at":"2026-05-18T01:24:39.138526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:39.138526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02973","source_version":1,"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-18T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bb0TeqLGIEn45eRRbmVykJ/GYrTownmekx6jz9ejBnp8JUb6wdy4bP/QVQSx3tSagOhNhLdd9CO9GsGMg2QZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:24:06.696544Z"},"content_sha256":"a44c71a33b22ff25df3448cbdbdadf1ad6ed428db45d91c9fa92757663b8f1f9","schema_version":"1.0","event_id":"sha256:a44c71a33b22ff25df3448cbdbdadf1ad6ed428db45d91c9fa92757663b8f1f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EUJF7PU7I4ELT2R22AO2DHTZD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Uniform f-vectors of Cutsets in the Truncated Boolean Lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Bajnok, Shahriar Shahriari","submitted_at":"2015-12-09T18:11:38Z","abstract_excerpt":"Let $[n] = \\{1, 2, \\ldots, n\\}$ and let $2^{[n]}$ be the collection of all subsets of $[n]$ ordered by inclusion. ${\\cal C} \\subseteq 2^{[n]}$ is a {\\em cutset} if it meets every maximal chain in $2^{[n]}$, and the {\\em width} of ${\\cal C} \\subseteq 2^{[n]}$ is the minimum number of chains in a chain decomposition of ${\\cal C}$. Fix $0 \\leq m \\leq l \\leq n$. What is the smallest value of $k$ such that there exists a cutset that consists only of subsets of sizes between $m$ and $l$, and such that it contains exactly $k$ subsets of size $i$ for each $m \\leq i \\leq l$? The answer, which we denote"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02973","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"},"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-18T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+sOG27cVGlruVxZtE58bjwnctRmxm0GyJPBoIiubuYikeDQUbVFqzFmzgvxUuzPWv1ITt6/akmUnS3ummO1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:24:06.696897Z"},"content_sha256":"0925cbee978bea2400b21b5d54bb0cf8ff62282b0755c5c1b8f857046ce7e7bc","schema_version":"1.0","event_id":"sha256:0925cbee978bea2400b21b5d54bb0cf8ff62282b0755c5c1b8f857046ce7e7bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUJF7PU7I4ELT2R22AO2DHTZD7/bundle.json","state_url":"https://pith.science/pith/EUJF7PU7I4ELT2R22AO2DHTZD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUJF7PU7I4ELT2R22AO2DHTZD7/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-04T09:24:06Z","links":{"resolver":"https://pith.science/pith/EUJF7PU7I4ELT2R22AO2DHTZD7","bundle":"https://pith.science/pith/EUJF7PU7I4ELT2R22AO2DHTZD7/bundle.json","state":"https://pith.science/pith/EUJF7PU7I4ELT2R22AO2DHTZD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUJF7PU7I4ELT2R22AO2DHTZD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EUJF7PU7I4ELT2R22AO2DHTZD7","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":"3a8f16db127c66ae3a836de00f564ec18974342d7509cfc05187ca8a7b5e3665","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T18:11:38Z","title_canon_sha256":"d68c71c263f36dece851ea82597582a6c805d8bf6da67cdef7117767ae024565"},"schema_version":"1.0","source":{"id":"1512.02973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02973","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02973v1","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02973","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"EUJF7PU7I4EL","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EUJF7PU7I4ELT2R2","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EUJF7PU7","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:0925cbee978bea2400b21b5d54bb0cf8ff62282b0755c5c1b8f857046ce7e7bc","target":"graph","created_at":"2026-05-18T01:24:39Z","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":"Let $[n] = \\{1, 2, \\ldots, n\\}$ and let $2^{[n]}$ be the collection of all subsets of $[n]$ ordered by inclusion. ${\\cal C} \\subseteq 2^{[n]}$ is a {\\em cutset} if it meets every maximal chain in $2^{[n]}$, and the {\\em width} of ${\\cal C} \\subseteq 2^{[n]}$ is the minimum number of chains in a chain decomposition of ${\\cal C}$. Fix $0 \\leq m \\leq l \\leq n$. What is the smallest value of $k$ such that there exists a cutset that consists only of subsets of sizes between $m$ and $l$, and such that it contains exactly $k$ subsets of size $i$ for each $m \\leq i \\leq l$? The answer, which we denote","authors_text":"B\\'ela Bajnok, Shahriar Shahriari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T18:11:38Z","title":"On Uniform f-vectors of Cutsets in the Truncated Boolean Lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02973","kind":"arxiv","version":1},"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:a44c71a33b22ff25df3448cbdbdadf1ad6ed428db45d91c9fa92757663b8f1f9","target":"record","created_at":"2026-05-18T01:24:39Z","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":"3a8f16db127c66ae3a836de00f564ec18974342d7509cfc05187ca8a7b5e3665","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T18:11:38Z","title_canon_sha256":"d68c71c263f36dece851ea82597582a6c805d8bf6da67cdef7117767ae024565"},"schema_version":"1.0","source":{"id":"1512.02973","kind":"arxiv","version":1}},"canonical_sha256":"25125fbe9f4708b9ea3ad01da19e791ffa948b1e53e1d9d53fc425157737ba82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25125fbe9f4708b9ea3ad01da19e791ffa948b1e53e1d9d53fc425157737ba82","first_computed_at":"2026-05-18T01:24:39.138526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:39.138526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQF/5XF5GeojWSKjd0ZuOYbnKL9Dvugd8x+9jBMmFuSfEjZIHVXXY/x4vGaeISbO4iYl7Y0Z3ZFlDKVYO9t8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:39.139001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a44c71a33b22ff25df3448cbdbdadf1ad6ed428db45d91c9fa92757663b8f1f9","sha256:0925cbee978bea2400b21b5d54bb0cf8ff62282b0755c5c1b8f857046ce7e7bc"],"state_sha256":"e28630d7cf086ce5a0944e463b6ca9e415d1bbc0f7ba58b34e3f3904c2ed444d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/a7Q7BXYN4sr9uy4AK7HtSfR49uE7SZ0/pPBjzHQhSR06hAjMe8R3qY1ExhmFGXBMF6sEHezOzJWM1AJ7rvCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:24:06.698892Z","bundle_sha256":"974a41ca287974dca18bd0fb62907e6281801116237ca4ca5db0afe842f4b6b1"}}