{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:J3CEPAFEBZMTBMZM664G6OXB7Z","short_pith_number":"pith:J3CEPAFE","canonical_record":{"source":{"id":"1510.02438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-08T18:49:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c02608f792958572a90d62f812caa2f12533270b40caa8227f5f2cfc0ff1bdab","abstract_canon_sha256":"58bffdba08b678cd113fa7ff4fe29a9e9480e44f54c73e11e135cb5273e5dae2"},"schema_version":"1.0"},"canonical_sha256":"4ec44780a40e5930b32cf7b86f3ae1fe42ff243ae570d515147c998101d8f5e7","source":{"kind":"arxiv","id":"1510.02438","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02438","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02438v2","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02438","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"J3CEPAFEBZMT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J3CEPAFEBZMTBMZM","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J3CEPAFE","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:J3CEPAFEBZMTBMZM664G6OXB7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-08T18:49:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c02608f792958572a90d62f812caa2f12533270b40caa8227f5f2cfc0ff1bdab","abstract_canon_sha256":"58bffdba08b678cd113fa7ff4fe29a9e9480e44f54c73e11e135cb5273e5dae2"},"schema_version":"1.0"},"canonical_sha256":"4ec44780a40e5930b32cf7b86f3ae1fe42ff243ae570d515147c998101d8f5e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.531801Z","signature_b64":"q0xQm3pFw3Ec+9GcB0EDZE7WQqmsRlHYk3iXjqAtMFLPtiMKveJQucxy02efIQhKRmmt+Ou17M8BqQHNIOIyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ec44780a40e5930b32cf7b86f3ae1fe42ff243ae570d515147c998101d8f5e7","last_reissued_at":"2026-05-18T00:14:57.531160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.531160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02438","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:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMe4oDitdtw/TNCBopGmmNCqhMYi5CcA92+HD2kxsBqHoyRmWz9++5H84CtrqLYZA5d5QLDSl1Ezy09OH9jEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:47:38.619569Z"},"content_sha256":"484691382793c5089f6b7bec343e8524543b9f0bcc20998ec036dd8ebb936788","schema_version":"1.0","event_id":"sha256:484691382793c5089f6b7bec343e8524543b9f0bcc20998ec036dd8ebb936788"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:J3CEPAFEBZMTBMZM664G6OXB7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing 1-Sperner hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Endre Boros, Martin Milani\\v{c}, Vladimir Gurvich","submitted_at":"2015-10-08T18:49:47Z","abstract_excerpt":"A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality) with positive coefficients. These combinatorial notions have many applications and are motivated by the theory of Boolean functions and integer programming. We introduce in this paper the class of $1$-Sperner hypergraphs, defined by the property that for every two hyperedges the smallest of their two set differences is of size one. We characterize this clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02438","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:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eI4SWEtG66KvXS6F/kJCFUXgDNFHxbtK8/rhF6FcSNvERVUZ6V8Ws1y+tYoHbcvBBFt6ohTC257ZHkzUfMhrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:47:38.619930Z"},"content_sha256":"4de45d3272b62a0c9cd4cb7b6d5aad1f20d228a3eb30d02e4d92c523e2e19a7d","schema_version":"1.0","event_id":"sha256:4de45d3272b62a0c9cd4cb7b6d5aad1f20d228a3eb30d02e4d92c523e2e19a7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3CEPAFEBZMTBMZM664G6OXB7Z/bundle.json","state_url":"https://pith.science/pith/J3CEPAFEBZMTBMZM664G6OXB7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3CEPAFEBZMTBMZM664G6OXB7Z/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-01T12:47:38Z","links":{"resolver":"https://pith.science/pith/J3CEPAFEBZMTBMZM664G6OXB7Z","bundle":"https://pith.science/pith/J3CEPAFEBZMTBMZM664G6OXB7Z/bundle.json","state":"https://pith.science/pith/J3CEPAFEBZMTBMZM664G6OXB7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3CEPAFEBZMTBMZM664G6OXB7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J3CEPAFEBZMTBMZM664G6OXB7Z","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":"58bffdba08b678cd113fa7ff4fe29a9e9480e44f54c73e11e135cb5273e5dae2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-08T18:49:47Z","title_canon_sha256":"c02608f792958572a90d62f812caa2f12533270b40caa8227f5f2cfc0ff1bdab"},"schema_version":"1.0","source":{"id":"1510.02438","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02438","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02438v2","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02438","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"J3CEPAFEBZMT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J3CEPAFEBZMTBMZM","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J3CEPAFE","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:4de45d3272b62a0c9cd4cb7b6d5aad1f20d228a3eb30d02e4d92c523e2e19a7d","target":"graph","created_at":"2026-05-18T00:14:57Z","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":"A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality) with positive coefficients. These combinatorial notions have many applications and are motivated by the theory of Boolean functions and integer programming. We introduce in this paper the class of $1$-Sperner hypergraphs, defined by the property that for every two hyperedges the smallest of their two set differences is of size one. We characterize this clas","authors_text":"Endre Boros, Martin Milani\\v{c}, Vladimir Gurvich","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-08T18:49:47Z","title":"Decomposing 1-Sperner hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02438","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:484691382793c5089f6b7bec343e8524543b9f0bcc20998ec036dd8ebb936788","target":"record","created_at":"2026-05-18T00:14:57Z","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":"58bffdba08b678cd113fa7ff4fe29a9e9480e44f54c73e11e135cb5273e5dae2","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-08T18:49:47Z","title_canon_sha256":"c02608f792958572a90d62f812caa2f12533270b40caa8227f5f2cfc0ff1bdab"},"schema_version":"1.0","source":{"id":"1510.02438","kind":"arxiv","version":2}},"canonical_sha256":"4ec44780a40e5930b32cf7b86f3ae1fe42ff243ae570d515147c998101d8f5e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ec44780a40e5930b32cf7b86f3ae1fe42ff243ae570d515147c998101d8f5e7","first_computed_at":"2026-05-18T00:14:57.531160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:57.531160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q0xQm3pFw3Ec+9GcB0EDZE7WQqmsRlHYk3iXjqAtMFLPtiMKveJQucxy02efIQhKRmmt+Ou17M8BqQHNIOIyDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:57.531801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02438","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:484691382793c5089f6b7bec343e8524543b9f0bcc20998ec036dd8ebb936788","sha256:4de45d3272b62a0c9cd4cb7b6d5aad1f20d228a3eb30d02e4d92c523e2e19a7d"],"state_sha256":"443e6f575d8dd29301e9206846e256fedca73f57944072bfcd69b7504acf6200"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnnAVg9r3ze4H/BT2LXqzLFrBJ5LX7fp3TRtfimTwH/9c4uyxDFCgRu/xlxkZQT268B+I5ycOj4ZXKUGCKSKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:47:38.621928Z","bundle_sha256":"7c41644c14a8b27fa7a56e39a5e957ac529bbc8386ba7f309f1c9448efa33a11"}}