{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FEU3SGSR4EQSPU5OKI3PNVJLRW","short_pith_number":"pith:FEU3SGSR","canonical_record":{"source":{"id":"1205.3529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-15T23:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"8e9a7a0bd59b437482f2995f5fee10f7058fab42a18195b9a4653969d37045ec","abstract_canon_sha256":"d50d40d54ce59865d598c3ff47ed6e66550c32cc8f23996c05d80c5f3921b066"},"schema_version":"1.0"},"canonical_sha256":"2929b91a51e12127d3ae5236f6d52b8daa726e71848a89b6ab7763e8faeef3f1","source":{"kind":"arxiv","id":"1205.3529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3529","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3529v1","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3529","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"FEU3SGSR4EQS","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FEU3SGSR4EQSPU5O","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FEU3SGSR","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FEU3SGSR4EQSPU5OKI3PNVJLRW","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-15T23:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"8e9a7a0bd59b437482f2995f5fee10f7058fab42a18195b9a4653969d37045ec","abstract_canon_sha256":"d50d40d54ce59865d598c3ff47ed6e66550c32cc8f23996c05d80c5f3921b066"},"schema_version":"1.0"},"canonical_sha256":"2929b91a51e12127d3ae5236f6d52b8daa726e71848a89b6ab7763e8faeef3f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:34.888220Z","signature_b64":"7nOYEiK43zkGgYc0WF5Tes3XrPus5tjjMegrgZxBlV6dEStLxE4Buik3P1Cej0rqyOoU/tXjFdJwzMCtjOIbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2929b91a51e12127d3ae5236f6d52b8daa726e71848a89b6ab7763e8faeef3f1","last_reissued_at":"2026-05-18T03:55:34.887492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:34.887492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3529","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-18T03:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/nLxdYR3RUgUD3tgq1Gd+G6t9VsW60eXGw8a3PH4dQt5zyqx86FG5bicicqA6dRScNR0ozQWq6k1N5ck/+fAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:45:11.289225Z"},"content_sha256":"5d4e42c0d7dd725b3b3a7c24c4ba28f8349f45de2b95769019790f8bff21076c","schema_version":"1.0","event_id":"sha256:5d4e42c0d7dd725b3b3a7c24c4ba28f8349f45de2b95769019790f8bff21076c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FEU3SGSR4EQSPU5OKI3PNVJLRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The entropy of random-free graphons and properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hamed Hatami, Serguei Norine","submitted_at":"2012-05-15T23:45:48Z","abstract_excerpt":"Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can grow as fast as any subquadratic function. However, if the graphon belongs to the closure of a random-free graph property, then the entropy is $O(n \\log n)$. We also give a simple construction of a non-stepfunction random-free graphon for which this entropy is linear, refuting a conjecture of Janson."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3529","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-18T03:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ulkjJKJjXV9uEPQHrOVD47mN4xia37ZfIO46ga4O3QoQdyXNbfl/Humon7mzXoGBVJcdnjaRku6x3E+5YZBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:45:11.289972Z"},"content_sha256":"2e23df10eddd0e0f5cc35473de996b1d041d4f8862bdd633f752fcb3d177fb51","schema_version":"1.0","event_id":"sha256:2e23df10eddd0e0f5cc35473de996b1d041d4f8862bdd633f752fcb3d177fb51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEU3SGSR4EQSPU5OKI3PNVJLRW/bundle.json","state_url":"https://pith.science/pith/FEU3SGSR4EQSPU5OKI3PNVJLRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEU3SGSR4EQSPU5OKI3PNVJLRW/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-05-30T15:45:11Z","links":{"resolver":"https://pith.science/pith/FEU3SGSR4EQSPU5OKI3PNVJLRW","bundle":"https://pith.science/pith/FEU3SGSR4EQSPU5OKI3PNVJLRW/bundle.json","state":"https://pith.science/pith/FEU3SGSR4EQSPU5OKI3PNVJLRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEU3SGSR4EQSPU5OKI3PNVJLRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FEU3SGSR4EQSPU5OKI3PNVJLRW","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":"d50d40d54ce59865d598c3ff47ed6e66550c32cc8f23996c05d80c5f3921b066","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-15T23:45:48Z","title_canon_sha256":"8e9a7a0bd59b437482f2995f5fee10f7058fab42a18195b9a4653969d37045ec"},"schema_version":"1.0","source":{"id":"1205.3529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3529","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3529v1","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3529","created_at":"2026-05-18T03:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"FEU3SGSR4EQS","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FEU3SGSR4EQSPU5O","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FEU3SGSR","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:2e23df10eddd0e0f5cc35473de996b1d041d4f8862bdd633f752fcb3d177fb51","target":"graph","created_at":"2026-05-18T03:55:34Z","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":"Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can grow as fast as any subquadratic function. However, if the graphon belongs to the closure of a random-free graph property, then the entropy is $O(n \\log n)$. We also give a simple construction of a non-stepfunction random-free graphon for which this entropy is linear, refuting a conjecture of Janson.","authors_text":"Hamed Hatami, Serguei Norine","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-15T23:45:48Z","title":"The entropy of random-free graphons and properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3529","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:5d4e42c0d7dd725b3b3a7c24c4ba28f8349f45de2b95769019790f8bff21076c","target":"record","created_at":"2026-05-18T03:55:34Z","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":"d50d40d54ce59865d598c3ff47ed6e66550c32cc8f23996c05d80c5f3921b066","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-15T23:45:48Z","title_canon_sha256":"8e9a7a0bd59b437482f2995f5fee10f7058fab42a18195b9a4653969d37045ec"},"schema_version":"1.0","source":{"id":"1205.3529","kind":"arxiv","version":1}},"canonical_sha256":"2929b91a51e12127d3ae5236f6d52b8daa726e71848a89b6ab7763e8faeef3f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2929b91a51e12127d3ae5236f6d52b8daa726e71848a89b6ab7763e8faeef3f1","first_computed_at":"2026-05-18T03:55:34.887492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:34.887492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7nOYEiK43zkGgYc0WF5Tes3XrPus5tjjMegrgZxBlV6dEStLxE4Buik3P1Cej0rqyOoU/tXjFdJwzMCtjOIbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:34.888220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d4e42c0d7dd725b3b3a7c24c4ba28f8349f45de2b95769019790f8bff21076c","sha256:2e23df10eddd0e0f5cc35473de996b1d041d4f8862bdd633f752fcb3d177fb51"],"state_sha256":"3f7c76f82e21917e1275e223681985d5a05311cb876eef7607191dcc2a799945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmZ/gkSLnio2UUWw4YH2z6u1XTK3hUiC2jLSVWLCIB+igQaYt/NvhZcp65ZsBAhFcZ4Mv3K/3L/pEMPkRbQBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:45:11.294570Z","bundle_sha256":"a58a25a4a6d854cde685c2c2ba9651835b3732b2cb04bd7e4258c981f7f43d21"}}