{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:L3JZ6IY32ZTRV75Y4LAHXAEEUG","short_pith_number":"pith:L3JZ6IY3","canonical_record":{"source":{"id":"1903.08232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T19:39:39Z","cross_cats_sorted":[],"title_canon_sha256":"34e8e282ef224c8e4432bf7d4b58bb4bc63752a292d9026b04f13aeec70d40fd","abstract_canon_sha256":"2352e4e1f22737d02f1fe11798636d517271678192caddc4d21bacec0b3f0184"},"schema_version":"1.0"},"canonical_sha256":"5ed39f231bd6671affb8e2c07b8084a1a081abaf7ea0bda39cefac6d0fa48a6d","source":{"kind":"arxiv","id":"1903.08232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08232","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08232v1","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08232","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"L3JZ6IY32ZTR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L3JZ6IY32ZTRV75Y","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L3JZ6IY3","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:L3JZ6IY32ZTRV75Y4LAHXAEEUG","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T19:39:39Z","cross_cats_sorted":[],"title_canon_sha256":"34e8e282ef224c8e4432bf7d4b58bb4bc63752a292d9026b04f13aeec70d40fd","abstract_canon_sha256":"2352e4e1f22737d02f1fe11798636d517271678192caddc4d21bacec0b3f0184"},"schema_version":"1.0"},"canonical_sha256":"5ed39f231bd6671affb8e2c07b8084a1a081abaf7ea0bda39cefac6d0fa48a6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:49.970749Z","signature_b64":"TTm956rGopyknPqJNnjyH/5oTVSuoj1MwYhXFcQcRM/4/q4DHa/2utgumSPxDn8uEeILk1DveyNKR+emJG9KCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ed39f231bd6671affb8e2c07b8084a1a081abaf7ea0bda39cefac6d0fa48a6d","last_reissued_at":"2026-05-17T23:50:49.970048Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:49.970048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08232","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-17T23:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLNb8QXys/at+IqmNqU8xV93neUZfd7dtzN2PlydYPCJF9aul1VGBInPhr7Ob6C+ArWPGvfPCimDn3YRIjWbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:20:53.714785Z"},"content_sha256":"c71448982c82c6592917a32994785f571f7e5df03e211adc39639f56eab55b40","schema_version":"1.0","event_id":"sha256:c71448982c82c6592917a32994785f571f7e5df03e211adc39639f56eab55b40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:L3JZ6IY32ZTRV75Y4LAHXAEEUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing 2-Independent Sets in 3-Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.J. Radcliffe, Lauren Keough","submitted_at":"2019-03-19T19:39:39Z","abstract_excerpt":"There has been interest recently in maximizing the number of independent sets in graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. Similarly, it is a corollary of the Kruskal-Katona theorem that the lex graph has the maximum number of independent sets in a graph of fixed size and order. In this paper we solve two equivalent problems.\n  The first is: what $3$-uniform hypergraph on a ground set of size $n$, having at least $t$ edges, has the most $2$-independent sets? Here a $2$--independent set is a subset of vertices conta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08232","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-17T23:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87yBjzwzVPYq+72O5hvyQHQvBocBAO/2EhVd6uW223TWxx5K7bpVUn0mRcYkP75bP+SvIEKRosWiXS7PgJ/7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:20:53.715145Z"},"content_sha256":"1e08866b83a5c3feb14a1b7fec1492a7017295f09a3965e7166b4f1840218281","schema_version":"1.0","event_id":"sha256:1e08866b83a5c3feb14a1b7fec1492a7017295f09a3965e7166b4f1840218281"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3JZ6IY32ZTRV75Y4LAHXAEEUG/bundle.json","state_url":"https://pith.science/pith/L3JZ6IY32ZTRV75Y4LAHXAEEUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3JZ6IY32ZTRV75Y4LAHXAEEUG/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-02T16:20:53Z","links":{"resolver":"https://pith.science/pith/L3JZ6IY32ZTRV75Y4LAHXAEEUG","bundle":"https://pith.science/pith/L3JZ6IY32ZTRV75Y4LAHXAEEUG/bundle.json","state":"https://pith.science/pith/L3JZ6IY32ZTRV75Y4LAHXAEEUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3JZ6IY32ZTRV75Y4LAHXAEEUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:L3JZ6IY32ZTRV75Y4LAHXAEEUG","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":"2352e4e1f22737d02f1fe11798636d517271678192caddc4d21bacec0b3f0184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T19:39:39Z","title_canon_sha256":"34e8e282ef224c8e4432bf7d4b58bb4bc63752a292d9026b04f13aeec70d40fd"},"schema_version":"1.0","source":{"id":"1903.08232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08232","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08232v1","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08232","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"L3JZ6IY32ZTR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L3JZ6IY32ZTRV75Y","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L3JZ6IY3","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:1e08866b83a5c3feb14a1b7fec1492a7017295f09a3965e7166b4f1840218281","target":"graph","created_at":"2026-05-17T23:50:49Z","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":"There has been interest recently in maximizing the number of independent sets in graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. Similarly, it is a corollary of the Kruskal-Katona theorem that the lex graph has the maximum number of independent sets in a graph of fixed size and order. In this paper we solve two equivalent problems.\n  The first is: what $3$-uniform hypergraph on a ground set of size $n$, having at least $t$ edges, has the most $2$-independent sets? Here a $2$--independent set is a subset of vertices conta","authors_text":"A.J. Radcliffe, Lauren Keough","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T19:39:39Z","title":"Maximizing 2-Independent Sets in 3-Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08232","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:c71448982c82c6592917a32994785f571f7e5df03e211adc39639f56eab55b40","target":"record","created_at":"2026-05-17T23:50:49Z","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":"2352e4e1f22737d02f1fe11798636d517271678192caddc4d21bacec0b3f0184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T19:39:39Z","title_canon_sha256":"34e8e282ef224c8e4432bf7d4b58bb4bc63752a292d9026b04f13aeec70d40fd"},"schema_version":"1.0","source":{"id":"1903.08232","kind":"arxiv","version":1}},"canonical_sha256":"5ed39f231bd6671affb8e2c07b8084a1a081abaf7ea0bda39cefac6d0fa48a6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ed39f231bd6671affb8e2c07b8084a1a081abaf7ea0bda39cefac6d0fa48a6d","first_computed_at":"2026-05-17T23:50:49.970048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:49.970048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TTm956rGopyknPqJNnjyH/5oTVSuoj1MwYhXFcQcRM/4/q4DHa/2utgumSPxDn8uEeILk1DveyNKR+emJG9KCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:49.970749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c71448982c82c6592917a32994785f571f7e5df03e211adc39639f56eab55b40","sha256:1e08866b83a5c3feb14a1b7fec1492a7017295f09a3965e7166b4f1840218281"],"state_sha256":"9a0a7b5676d0951ce2319247cd2f7513fdc9ae3f0bc67939b58c3008bd9f291f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwNp41v9FRe/W1rQsRol0unjls0e1IZxwWJirHL+VIlHZukA0yMdR4VwJz3BMc4SXnWTsgwIowYsrFq/RvoiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:20:53.717092Z","bundle_sha256":"e134801f2c19746d9d5bdbbf65ee1ec3b9b770519b61e2d04095619b4efae053"}}