{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:47OFMDBUKBUGUWYNRI2AVNVNYQ","short_pith_number":"pith:47OFMDBU","canonical_record":{"source":{"id":"1706.02612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-08T14:36:16Z","cross_cats_sorted":[],"title_canon_sha256":"0f8556adfd2076614f72f4b65aefca781b16c87fb7e8279460b88ebc78c6549c","abstract_canon_sha256":"f724b5f5103144e653ff01e889b078116ee25ba3a08531c9e0d9115b13a118f5"},"schema_version":"1.0"},"canonical_sha256":"e7dc560c3450686a5b0d8a340ab6adc4033b23ab887a8092a6512505f95991cf","source":{"kind":"arxiv","id":"1706.02612","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02612","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02612v2","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02612","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"47OFMDBUKBUG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"47OFMDBUKBUGUWYN","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"47OFMDBU","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:47OFMDBUKBUGUWYNRI2AVNVNYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-08T14:36:16Z","cross_cats_sorted":[],"title_canon_sha256":"0f8556adfd2076614f72f4b65aefca781b16c87fb7e8279460b88ebc78c6549c","abstract_canon_sha256":"f724b5f5103144e653ff01e889b078116ee25ba3a08531c9e0d9115b13a118f5"},"schema_version":"1.0"},"canonical_sha256":"e7dc560c3450686a5b0d8a340ab6adc4033b23ab887a8092a6512505f95991cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:49.313460Z","signature_b64":"vq2OjYR+9LSBVEgOd82BSGzDga2Yy6OR6Vq8osSB2tKMyuhvClFnPWdS0LO5KyvGxM4k1rtvgMLQCDq2Q9J9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7dc560c3450686a5b0d8a340ab6adc4033b23ab887a8092a6512505f95991cf","last_reissued_at":"2026-05-18T00:22:49.313061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:49.313061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02612","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-18T00:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysJjovJHT+755hu2yum8bYoOe0QXqVzWcffnRdWKtujJFyznhvz+gUsL4tflVL5MNS8Sr+jv5vPIHvZHglIJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:55:53.484100Z"},"content_sha256":"a793d6c7a3ed161242f5c48f7bae23fc01c7ac747cb9a4f719c9aff82658306a","schema_version":"1.0","event_id":"sha256:a793d6c7a3ed161242f5c48f7bae23fc01c7ac747cb9a4f719c9aff82658306a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:47OFMDBUKBUGUWYNRI2AVNVNYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Forms of Stability from Flag Algebra Calculations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Sliacan, Konstantinos Tyros, Oleg Pikhurko","submitted_at":"2017-06-08T14:36:16Z","abstract_excerpt":"Given a hereditary family $\\mathcal{G}$ of admissible graphs and a function $\\lambda(G)$ that linearly depends on the statistics of order-$\\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining $\\lambda(n,\\mathcal{G})$, the maximum of $\\lambda(G)$ over all admissible graphs $G$ of order $n$. We call the problem perfectly $B$-stable for a graph $B$ if there is a constant $C$ such that every admissible graph $G$ of order $n\\ge C$ can be made into a blow-up of $B$ by changing at most $C(\\lambda(n,\\mathcal{G})-\\lambda(G)){n\\choose2}$ adjacencies. As special cases, this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02612","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-18T00:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VQLkKYG225LYvgk+r23oMCamyy5nhwx3A/Jl4MEm2TjXAB5BYOAffT7+qceq5vprC4vVLoLtW/YsU8n6Y0uCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:55:53.484506Z"},"content_sha256":"b661664ad95ab07747d60c3b74d8bc42f8be097b28383159a95fbad5cbf7fd5c","schema_version":"1.0","event_id":"sha256:b661664ad95ab07747d60c3b74d8bc42f8be097b28383159a95fbad5cbf7fd5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47OFMDBUKBUGUWYNRI2AVNVNYQ/bundle.json","state_url":"https://pith.science/pith/47OFMDBUKBUGUWYNRI2AVNVNYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47OFMDBUKBUGUWYNRI2AVNVNYQ/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-19T19:55:53Z","links":{"resolver":"https://pith.science/pith/47OFMDBUKBUGUWYNRI2AVNVNYQ","bundle":"https://pith.science/pith/47OFMDBUKBUGUWYNRI2AVNVNYQ/bundle.json","state":"https://pith.science/pith/47OFMDBUKBUGUWYNRI2AVNVNYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47OFMDBUKBUGUWYNRI2AVNVNYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:47OFMDBUKBUGUWYNRI2AVNVNYQ","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":"f724b5f5103144e653ff01e889b078116ee25ba3a08531c9e0d9115b13a118f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-08T14:36:16Z","title_canon_sha256":"0f8556adfd2076614f72f4b65aefca781b16c87fb7e8279460b88ebc78c6549c"},"schema_version":"1.0","source":{"id":"1706.02612","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02612","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02612v2","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02612","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"47OFMDBUKBUG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"47OFMDBUKBUGUWYN","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"47OFMDBU","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:b661664ad95ab07747d60c3b74d8bc42f8be097b28383159a95fbad5cbf7fd5c","target":"graph","created_at":"2026-05-18T00:22: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":"Given a hereditary family $\\mathcal{G}$ of admissible graphs and a function $\\lambda(G)$ that linearly depends on the statistics of order-$\\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining $\\lambda(n,\\mathcal{G})$, the maximum of $\\lambda(G)$ over all admissible graphs $G$ of order $n$. We call the problem perfectly $B$-stable for a graph $B$ if there is a constant $C$ such that every admissible graph $G$ of order $n\\ge C$ can be made into a blow-up of $B$ by changing at most $C(\\lambda(n,\\mathcal{G})-\\lambda(G)){n\\choose2}$ adjacencies. As special cases, this p","authors_text":"Jakub Sliacan, Konstantinos Tyros, Oleg Pikhurko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-08T14:36:16Z","title":"Strong Forms of Stability from Flag Algebra Calculations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02612","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:a793d6c7a3ed161242f5c48f7bae23fc01c7ac747cb9a4f719c9aff82658306a","target":"record","created_at":"2026-05-18T00:22: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":"f724b5f5103144e653ff01e889b078116ee25ba3a08531c9e0d9115b13a118f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-08T14:36:16Z","title_canon_sha256":"0f8556adfd2076614f72f4b65aefca781b16c87fb7e8279460b88ebc78c6549c"},"schema_version":"1.0","source":{"id":"1706.02612","kind":"arxiv","version":2}},"canonical_sha256":"e7dc560c3450686a5b0d8a340ab6adc4033b23ab887a8092a6512505f95991cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7dc560c3450686a5b0d8a340ab6adc4033b23ab887a8092a6512505f95991cf","first_computed_at":"2026-05-18T00:22:49.313061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:49.313061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vq2OjYR+9LSBVEgOd82BSGzDga2Yy6OR6Vq8osSB2tKMyuhvClFnPWdS0LO5KyvGxM4k1rtvgMLQCDq2Q9J9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:49.313460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02612","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a793d6c7a3ed161242f5c48f7bae23fc01c7ac747cb9a4f719c9aff82658306a","sha256:b661664ad95ab07747d60c3b74d8bc42f8be097b28383159a95fbad5cbf7fd5c"],"state_sha256":"b038a7ae38d02d2d3e8b646367fe32f1774e1736fbda2ff836c1deb5e6667e09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pzSm4GSOzxXcsgNnvKKBrrxP8lGGf1TA5nvWzvCk6IuyNxZsmkoVKQLhmKJf9AzAsInBuIszpGZZUJ/CgYFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:55:53.487456Z","bundle_sha256":"59ca275a5257dc018138099072f28be7d4a68d5d54e3d723b08bc37cb67abb63"}}