{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:NUPWQ3LB6A7Q2AHYXV2LXSP4W6","short_pith_number":"pith:NUPWQ3LB","canonical_record":{"source":{"id":"0911.4204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-21T21:40:18Z","cross_cats_sorted":[],"title_canon_sha256":"536d3b18615ecb7105872cac0a4e35309478273893a3bcc35ae4237231db86e0","abstract_canon_sha256":"8dfc86ee131a3d903804b138f2afb74de6bcdfcd23e3a7942b3b63004cc80e7b"},"schema_version":"1.0"},"canonical_sha256":"6d1f686d61f03f0d00f8bd74bbc9fcb7b282ec12e0e9d96bf9ad57d2a9ad5902","source":{"kind":"arxiv","id":"0911.4204","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4204","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4204v2","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4204","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"NUPWQ3LB6A7Q","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NUPWQ3LB6A7Q2AHY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NUPWQ3LB","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:NUPWQ3LB6A7Q2AHYXV2LXSP4W6","target":"record","payload":{"canonical_record":{"source":{"id":"0911.4204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-21T21:40:18Z","cross_cats_sorted":[],"title_canon_sha256":"536d3b18615ecb7105872cac0a4e35309478273893a3bcc35ae4237231db86e0","abstract_canon_sha256":"8dfc86ee131a3d903804b138f2afb74de6bcdfcd23e3a7942b3b63004cc80e7b"},"schema_version":"1.0"},"canonical_sha256":"6d1f686d61f03f0d00f8bd74bbc9fcb7b282ec12e0e9d96bf9ad57d2a9ad5902","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:44.857031Z","signature_b64":"VByF6tOynW8EI3Ij7JXFCJL1Lmd9FptBNXuIscRc9xv7RpYEMyCY/WA3RJBkSVdqL3pN7ImIZv6LFulUU8O2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d1f686d61f03f0d00f8bd74bbc9fcb7b282ec12e0e9d96bf9ad57d2a9ad5902","last_reissued_at":"2026-05-18T04:41:44.856665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:44.856665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.4204","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-18T04:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBYfDngg3rQXFeKM4aubX2TbRrrUHjWFqQUkRekxsAWODOCu0Iw2yQAtdiTJcGAep3NFblIYbxYJpis4B8waBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:35:25.359903Z"},"content_sha256":"c6b27c3c3991c559b6a8c848cff8c85b0db2d783cd64b694dd7848d98692573b","schema_version":"1.0","event_id":"sha256:c6b27c3c3991c559b6a8c848cff8c85b0db2d783cd64b694dd7848d98692573b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:NUPWQ3LB6A7Q2AHYXV2LXSP4W6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal independent sets and separating covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vincent Vatter","submitted_at":"2009-11-21T21:40:18Z","abstract_excerpt":"In 1973, Katona raised the problem of determining the maximum number of subsets in a separating cover on n elements. The answer to Katona's question turns out to be the inverse to the answer to a much simpler question: what is the largest integer which is the product of positive integers with sum n? We give a combinatorial explanation for this relationship, via Moon and Moser's answer to a question of Erdos: how many maximal independent sets can a graph on n vertices have? We conclude by showing how Moon and Moser's solution also sheds light on a problem of Mahler and Popken's about the comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4204","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-18T04:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHzblGRFqhgt5jDIE0ck/1XVVU1IqU2nUYwI8tT8XAabj3nBV7rqIX75eVlq7XzJcW5nnM8CD8+NaWu/T/xQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:35:25.360244Z"},"content_sha256":"96b437567a6ecca49cadf843c8470c5c0ef1ab0cf4c09cdc58a9b6189247d027","schema_version":"1.0","event_id":"sha256:96b437567a6ecca49cadf843c8470c5c0ef1ab0cf4c09cdc58a9b6189247d027"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUPWQ3LB6A7Q2AHYXV2LXSP4W6/bundle.json","state_url":"https://pith.science/pith/NUPWQ3LB6A7Q2AHYXV2LXSP4W6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUPWQ3LB6A7Q2AHYXV2LXSP4W6/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-08T22:35:25Z","links":{"resolver":"https://pith.science/pith/NUPWQ3LB6A7Q2AHYXV2LXSP4W6","bundle":"https://pith.science/pith/NUPWQ3LB6A7Q2AHYXV2LXSP4W6/bundle.json","state":"https://pith.science/pith/NUPWQ3LB6A7Q2AHYXV2LXSP4W6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUPWQ3LB6A7Q2AHYXV2LXSP4W6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:NUPWQ3LB6A7Q2AHYXV2LXSP4W6","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":"8dfc86ee131a3d903804b138f2afb74de6bcdfcd23e3a7942b3b63004cc80e7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-21T21:40:18Z","title_canon_sha256":"536d3b18615ecb7105872cac0a4e35309478273893a3bcc35ae4237231db86e0"},"schema_version":"1.0","source":{"id":"0911.4204","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4204","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4204v2","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4204","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"NUPWQ3LB6A7Q","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NUPWQ3LB6A7Q2AHY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NUPWQ3LB","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:96b437567a6ecca49cadf843c8470c5c0ef1ab0cf4c09cdc58a9b6189247d027","target":"graph","created_at":"2026-05-18T04:41:44Z","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":"In 1973, Katona raised the problem of determining the maximum number of subsets in a separating cover on n elements. The answer to Katona's question turns out to be the inverse to the answer to a much simpler question: what is the largest integer which is the product of positive integers with sum n? We give a combinatorial explanation for this relationship, via Moon and Moser's answer to a question of Erdos: how many maximal independent sets can a graph on n vertices have? We conclude by showing how Moon and Moser's solution also sheds light on a problem of Mahler and Popken's about the comple","authors_text":"Vincent Vatter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-21T21:40:18Z","title":"Maximal independent sets and separating covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4204","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:c6b27c3c3991c559b6a8c848cff8c85b0db2d783cd64b694dd7848d98692573b","target":"record","created_at":"2026-05-18T04:41:44Z","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":"8dfc86ee131a3d903804b138f2afb74de6bcdfcd23e3a7942b3b63004cc80e7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-21T21:40:18Z","title_canon_sha256":"536d3b18615ecb7105872cac0a4e35309478273893a3bcc35ae4237231db86e0"},"schema_version":"1.0","source":{"id":"0911.4204","kind":"arxiv","version":2}},"canonical_sha256":"6d1f686d61f03f0d00f8bd74bbc9fcb7b282ec12e0e9d96bf9ad57d2a9ad5902","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d1f686d61f03f0d00f8bd74bbc9fcb7b282ec12e0e9d96bf9ad57d2a9ad5902","first_computed_at":"2026-05-18T04:41:44.856665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:44.856665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VByF6tOynW8EI3Ij7JXFCJL1Lmd9FptBNXuIscRc9xv7RpYEMyCY/WA3RJBkSVdqL3pN7ImIZv6LFulUU8O2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:44.857031Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4204","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6b27c3c3991c559b6a8c848cff8c85b0db2d783cd64b694dd7848d98692573b","sha256:96b437567a6ecca49cadf843c8470c5c0ef1ab0cf4c09cdc58a9b6189247d027"],"state_sha256":"ba87bdac85c607e112790d433abf6f4e0effb5d108aa0a11ae572630ddc5297d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nU8gCrdKydDfZNP3TCkPe9ne+aawGPrWJgPzwpnmTZVKj0N72bTQCADSq3zZB5M5EUf533rFoJ9+A5VuxmQ2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:35:25.362119Z","bundle_sha256":"47489ff8345fba69c4f66186e46498a8f22e4cb6b86c188b389affbcc34d29b5"}}