{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LWAXJHFZYVIBXNFIIKNK4OJ5YC","short_pith_number":"pith:LWAXJHFZ","canonical_record":{"source":{"id":"1505.08044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T13:49:01Z","cross_cats_sorted":[],"title_canon_sha256":"c3cd66c9a74455f349e9040636886261dba36916e134c19c7ce099d0d6af18f3","abstract_canon_sha256":"31e41e5795ea637f6b515f0dc9b0889f9251c97310fec8c7f22f6af5978bf6e1"},"schema_version":"1.0"},"canonical_sha256":"5d81749cb9c5501bb4a8429aae393dc082a057e4e8d9b9fe5a1107960a6d9ec3","source":{"kind":"arxiv","id":"1505.08044","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08044","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08044v2","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08044","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"LWAXJHFZYVIB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWAXJHFZYVIBXNFI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWAXJHFZ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LWAXJHFZYVIBXNFIIKNK4OJ5YC","target":"record","payload":{"canonical_record":{"source":{"id":"1505.08044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T13:49:01Z","cross_cats_sorted":[],"title_canon_sha256":"c3cd66c9a74455f349e9040636886261dba36916e134c19c7ce099d0d6af18f3","abstract_canon_sha256":"31e41e5795ea637f6b515f0dc9b0889f9251c97310fec8c7f22f6af5978bf6e1"},"schema_version":"1.0"},"canonical_sha256":"5d81749cb9c5501bb4a8429aae393dc082a057e4e8d9b9fe5a1107960a6d9ec3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:50.433530Z","signature_b64":"dITJnioJc3RH36X8EoY1kzXtUaMhXStrBcZju74HPxNbKy+tpCZfGuonRUN6rvA3KlgxPYETjZk5ujdVZ+H3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d81749cb9c5501bb4a8429aae393dc082a057e4e8d9b9fe5a1107960a6d9ec3","last_reissued_at":"2026-05-18T01:16:50.432821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:50.432821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.08044","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-18T01:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMIMT1+GH0kV93Pqc/khHTHS11y/qsEKKsnvVsMyP7g3NQ4W/qpKZ0vFHXXl/xqi/qWX3TK2+/bArGMSH3hVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:50:33.702543Z"},"content_sha256":"acfcd81ae618f6f7abfd207637ae4dd3ade6183f1d9eb79d021e132a3c5e7eb0","schema_version":"1.0","event_id":"sha256:acfcd81ae618f6f7abfd207637ae4dd3ade6183f1d9eb79d021e132a3c5e7eb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LWAXJHFZYVIBXNFIIKNK4OJ5YC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, Karen Gunderson, Paul Balister","submitted_at":"2015-05-29T13:49:01Z","abstract_excerpt":"The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that, in fact, every positive independence density of a countably infinite hypergraph with hyperedges of bounded size is equal to the independence density of some finite hypergraph whose hyperedges are no larger than those in the infinite hypergraph. This answers a question of Bonato, Brown, Kemkes, and Pra{\\l}at about independence densities of graphs. Furthermore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08044","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-18T01:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGweLY5Vx/0gEfzL49KWjoYH5FA3STCImr00mlSSEcKirRtvWWSGZRPnME0EIGG5mDeZC8RndShlPE6XUwtJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:50:33.702899Z"},"content_sha256":"6e31de58f766f1cb6107f68dd063293eb80fda3fc47e6d65f42f64eacc2ee557","schema_version":"1.0","event_id":"sha256:6e31de58f766f1cb6107f68dd063293eb80fda3fc47e6d65f42f64eacc2ee557"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWAXJHFZYVIBXNFIIKNK4OJ5YC/bundle.json","state_url":"https://pith.science/pith/LWAXJHFZYVIBXNFIIKNK4OJ5YC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWAXJHFZYVIBXNFIIKNK4OJ5YC/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-02T07:50:33Z","links":{"resolver":"https://pith.science/pith/LWAXJHFZYVIBXNFIIKNK4OJ5YC","bundle":"https://pith.science/pith/LWAXJHFZYVIBXNFIIKNK4OJ5YC/bundle.json","state":"https://pith.science/pith/LWAXJHFZYVIBXNFIIKNK4OJ5YC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWAXJHFZYVIBXNFIIKNK4OJ5YC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LWAXJHFZYVIBXNFIIKNK4OJ5YC","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":"31e41e5795ea637f6b515f0dc9b0889f9251c97310fec8c7f22f6af5978bf6e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T13:49:01Z","title_canon_sha256":"c3cd66c9a74455f349e9040636886261dba36916e134c19c7ce099d0d6af18f3"},"schema_version":"1.0","source":{"id":"1505.08044","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08044","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08044v2","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08044","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"LWAXJHFZYVIB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWAXJHFZYVIBXNFI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWAXJHFZ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:6e31de58f766f1cb6107f68dd063293eb80fda3fc47e6d65f42f64eacc2ee557","target":"graph","created_at":"2026-05-18T01:16:50Z","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 independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that, in fact, every positive independence density of a countably infinite hypergraph with hyperedges of bounded size is equal to the independence density of some finite hypergraph whose hyperedges are no larger than those in the infinite hypergraph. This answers a question of Bonato, Brown, Kemkes, and Pra{\\l}at about independence densities of graphs. Furthermore","authors_text":"B\\'ela Bollob\\'as, Karen Gunderson, Paul Balister","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T13:49:01Z","title":"Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08044","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:acfcd81ae618f6f7abfd207637ae4dd3ade6183f1d9eb79d021e132a3c5e7eb0","target":"record","created_at":"2026-05-18T01:16:50Z","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":"31e41e5795ea637f6b515f0dc9b0889f9251c97310fec8c7f22f6af5978bf6e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T13:49:01Z","title_canon_sha256":"c3cd66c9a74455f349e9040636886261dba36916e134c19c7ce099d0d6af18f3"},"schema_version":"1.0","source":{"id":"1505.08044","kind":"arxiv","version":2}},"canonical_sha256":"5d81749cb9c5501bb4a8429aae393dc082a057e4e8d9b9fe5a1107960a6d9ec3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d81749cb9c5501bb4a8429aae393dc082a057e4e8d9b9fe5a1107960a6d9ec3","first_computed_at":"2026-05-18T01:16:50.432821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:50.432821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dITJnioJc3RH36X8EoY1kzXtUaMhXStrBcZju74HPxNbKy+tpCZfGuonRUN6rvA3KlgxPYETjZk5ujdVZ+H3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:50.433530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.08044","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acfcd81ae618f6f7abfd207637ae4dd3ade6183f1d9eb79d021e132a3c5e7eb0","sha256:6e31de58f766f1cb6107f68dd063293eb80fda3fc47e6d65f42f64eacc2ee557"],"state_sha256":"f7d155724f41df5e8c6a7294766d71ba60723ac9b78895b5b132b4911af7e5db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NlZOjVpFUJ0tTScAaN3jXz4J1tB2O1qZQGVHV1ePYmYFyUUhJVP3jbm3V41U4U3Baz2CNydkamd1CvWjT+dAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:50:33.704906Z","bundle_sha256":"f246195010c3433f14d132a86accf2c6f372f816bb356c57199834bd21210d58"}}