{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6OX466DSTENYB4UJIWNKG5F762","short_pith_number":"pith:6OX466DS","canonical_record":{"source":{"id":"1701.03846","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-13T22:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"5d7de4b61723e09d5c1e026600b03b20aab28d6919b13bb71d9af9da61757de0","abstract_canon_sha256":"71966236956949319a4410433e7a3e8e2b140094b1531188eede81eb35f0dfbf"},"schema_version":"1.0"},"canonical_sha256":"f3afcf7872991b80f289459aa374bff6a8cfe4499b9c01c519aa5495ec55b170","source":{"kind":"arxiv","id":"1701.03846","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03846","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03846v5","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03846","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"6OX466DSTENY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6OX466DSTENYB4UJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6OX466DS","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6OX466DSTENYB4UJIWNKG5F762","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03846","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-13T22:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"5d7de4b61723e09d5c1e026600b03b20aab28d6919b13bb71d9af9da61757de0","abstract_canon_sha256":"71966236956949319a4410433e7a3e8e2b140094b1531188eede81eb35f0dfbf"},"schema_version":"1.0"},"canonical_sha256":"f3afcf7872991b80f289459aa374bff6a8cfe4499b9c01c519aa5495ec55b170","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:50.393881Z","signature_b64":"b8HeNmQ6pCCASAGNZRR8OJ/hlJE6S/iz1/njybghSN6qh7Q/BMa5J3g4wha+SHnSWc1AbS5Rsd5Nu1UzUGuDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3afcf7872991b80f289459aa374bff6a8cfe4499b9c01c519aa5495ec55b170","last_reissued_at":"2026-05-18T00:03:50.393289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:50.393289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03846","source_version":5,"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:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pATIqaIothE04EBmuUBKBhpdMTeaaIu1LMTr0XDewA8Fa5DX0ucM3/zdsDWOSP/bjeVm8YgmZ5WbQ56ig1jvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:53:58.169332Z"},"content_sha256":"536f5889446028563d7faedb379447e5b40dd8977ae56259a20d811dca2dcbc5","schema_version":"1.0","event_id":"sha256:536f5889446028563d7faedb379447e5b40dd8977ae56259a20d811dca2dcbc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6OX466DSTENYB4UJIWNKG5F762","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finitely forcible graph limits are universal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jacob W. Cooper, Taisa L. Martins","submitted_at":"2017-01-13T22:48:53Z","abstract_excerpt":"The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly within extremal combinatorics. Lovasz and Szegedy conjectured that all such graphons possess a simple structure, e.g., the space of their typical vertices is always finite dimensional; this was disproved by several ad hoc constructions of complex finitely forcible graphons. We prove that any graphon is a subgraphon of a finitely forcible graphon. This dismis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03846","kind":"arxiv","version":5},"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:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjIHRhmLWQzAOMEVRoCHjdPs9VWmHgIKKCNyb4yxrL/fmh0uqCiv/leFEMREy4n4oX2k+J7nViLzmrISqVYzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:53:58.170063Z"},"content_sha256":"c2dcf86cd7e3af70ca99c93b433fde2343b79fcbcbd575ad9477fa432a7ee430","schema_version":"1.0","event_id":"sha256:c2dcf86cd7e3af70ca99c93b433fde2343b79fcbcbd575ad9477fa432a7ee430"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OX466DSTENYB4UJIWNKG5F762/bundle.json","state_url":"https://pith.science/pith/6OX466DSTENYB4UJIWNKG5F762/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OX466DSTENYB4UJIWNKG5F762/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-07T23:53:58Z","links":{"resolver":"https://pith.science/pith/6OX466DSTENYB4UJIWNKG5F762","bundle":"https://pith.science/pith/6OX466DSTENYB4UJIWNKG5F762/bundle.json","state":"https://pith.science/pith/6OX466DSTENYB4UJIWNKG5F762/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OX466DSTENYB4UJIWNKG5F762/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6OX466DSTENYB4UJIWNKG5F762","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":"71966236956949319a4410433e7a3e8e2b140094b1531188eede81eb35f0dfbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-13T22:48:53Z","title_canon_sha256":"5d7de4b61723e09d5c1e026600b03b20aab28d6919b13bb71d9af9da61757de0"},"schema_version":"1.0","source":{"id":"1701.03846","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03846","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03846v5","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03846","created_at":"2026-05-18T00:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"6OX466DSTENY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6OX466DSTENYB4UJ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6OX466DS","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:c2dcf86cd7e3af70ca99c93b433fde2343b79fcbcbd575ad9477fa432a7ee430","target":"graph","created_at":"2026-05-18T00:03: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 theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly within extremal combinatorics. Lovasz and Szegedy conjectured that all such graphons possess a simple structure, e.g., the space of their typical vertices is always finite dimensional; this was disproved by several ad hoc constructions of complex finitely forcible graphons. We prove that any graphon is a subgraphon of a finitely forcible graphon. This dismis","authors_text":"Daniel Kral, Jacob W. Cooper, Taisa L. Martins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-13T22:48:53Z","title":"Finitely forcible graph limits are universal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03846","kind":"arxiv","version":5},"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:536f5889446028563d7faedb379447e5b40dd8977ae56259a20d811dca2dcbc5","target":"record","created_at":"2026-05-18T00:03: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":"71966236956949319a4410433e7a3e8e2b140094b1531188eede81eb35f0dfbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-13T22:48:53Z","title_canon_sha256":"5d7de4b61723e09d5c1e026600b03b20aab28d6919b13bb71d9af9da61757de0"},"schema_version":"1.0","source":{"id":"1701.03846","kind":"arxiv","version":5}},"canonical_sha256":"f3afcf7872991b80f289459aa374bff6a8cfe4499b9c01c519aa5495ec55b170","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3afcf7872991b80f289459aa374bff6a8cfe4499b9c01c519aa5495ec55b170","first_computed_at":"2026-05-18T00:03:50.393289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:50.393289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b8HeNmQ6pCCASAGNZRR8OJ/hlJE6S/iz1/njybghSN6qh7Q/BMa5J3g4wha+SHnSWc1AbS5Rsd5Nu1UzUGuDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:50.393881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03846","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:536f5889446028563d7faedb379447e5b40dd8977ae56259a20d811dca2dcbc5","sha256:c2dcf86cd7e3af70ca99c93b433fde2343b79fcbcbd575ad9477fa432a7ee430"],"state_sha256":"fa5ce533d55a79911281439436a733d58e380dfc6a47bb54bc95695507a16bcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8zCmjgE1arQ3ufA3Vcd9GdjWCKMvXRIjPT5KFUpOV44Xpr+/tzsq2FJiZLjonktSQiZ4a/bjD185BeRQlMuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:53:58.174477Z","bundle_sha256":"29d66ec78db3c1c446a30a50045ec6b5ab5cbe60312907e7aac93f9612f56abe"}}