{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NRKEK4FTW5ATN2ZC7VWAT7FH2C","short_pith_number":"pith:NRKEK4FT","canonical_record":{"source":{"id":"1811.08750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-21T14:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"97ee1c07e311c659a265fc4d05f7e2ad3261c7827c8b505747b53803aa04fdee","abstract_canon_sha256":"36363d177dead4004bf3900179796fd00433948e353e96d05e181f3ed532cb23"},"schema_version":"1.0"},"canonical_sha256":"6c544570b3b74136eb22fd6c09fca7d0a173089b1b7779fd9aea1029a05dc7ff","source":{"kind":"arxiv","id":"1811.08750","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08750","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08750v1","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08750","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"NRKEK4FTW5AT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NRKEK4FTW5ATN2ZC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NRKEK4FT","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NRKEK4FTW5ATN2ZC7VWAT7FH2C","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-21T14:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"97ee1c07e311c659a265fc4d05f7e2ad3261c7827c8b505747b53803aa04fdee","abstract_canon_sha256":"36363d177dead4004bf3900179796fd00433948e353e96d05e181f3ed532cb23"},"schema_version":"1.0"},"canonical_sha256":"6c544570b3b74136eb22fd6c09fca7d0a173089b1b7779fd9aea1029a05dc7ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:11.685579Z","signature_b64":"flG49nIArMPXUVxPMrvo2opg74e2ew/k4CLMLdMZE5VIF5q1AxnAL1QTQC3ScLfWlSVBLF87Qry6bOBlIiOzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c544570b3b74136eb22fd6c09fca7d0a173089b1b7779fd9aea1029a05dc7ff","last_reissued_at":"2026-05-18T00:00:11.684920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:11.684920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08750","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-18T00:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRmfW1UAOo6BFnLb5dVTxu76n7FZ5VFf6rtpjhmBk8ReXtgaL5U130UsKiKEYNK9c0AJDu1MygDFfWQu7BQuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:48:11.381714Z"},"content_sha256":"d3846bd19824ad3238135973e2bbb4dbcb11e127a3f23b1549011ed2c185c4eb","schema_version":"1.0","event_id":"sha256:d3846bd19824ad3238135973e2bbb4dbcb11e127a3f23b1549011ed2c185c4eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NRKEK4FTW5ATN2ZC7VWAT7FH2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Additive Approximation of Generalized Tur\\'an Questions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clara Shikhelman, Noga Alon","submitted_at":"2018-11-21T14:28:44Z","abstract_excerpt":"For graphs $G$ and $T$, and a family of graphs $\\mathcal{F}$ let $\\mathrm{ex}(G,T,\\mathcal{F})$ denote the maximum possible number of copies of $T$ in an $\\mathcal{F}$-free subgraph of $G$. We investigate the algorithmic aspects of calculating and estimating this function. We show that for every graph $T$, finite family $\\mathcal{F}$ and constant $\\epsilon>0$ there is a polynomial time algorithm that approximates $\\mathrm{ex}(G,T,\\mathcal{F})$ for an input graph $G$ on $n$ vertices up to an additive error of $\\epsilon n^{v(T)}$. We also consider the possibility of a better approximation, provi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08750","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-18T00:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iA0wFTDm7D7np22s1wYXUHbZT6FOL+jZexnlRtt2GQ0yVy9Z4JKPfIPmhyM4GRHXFG/v0Y9qYIsM8RZnvFdJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:48:11.382276Z"},"content_sha256":"80d6226f258c51edcd7f710b2e0e76e0ed4e8b06a549f92df9d72e8b7b868742","schema_version":"1.0","event_id":"sha256:80d6226f258c51edcd7f710b2e0e76e0ed4e8b06a549f92df9d72e8b7b868742"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRKEK4FTW5ATN2ZC7VWAT7FH2C/bundle.json","state_url":"https://pith.science/pith/NRKEK4FTW5ATN2ZC7VWAT7FH2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRKEK4FTW5ATN2ZC7VWAT7FH2C/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-28T20:48:11Z","links":{"resolver":"https://pith.science/pith/NRKEK4FTW5ATN2ZC7VWAT7FH2C","bundle":"https://pith.science/pith/NRKEK4FTW5ATN2ZC7VWAT7FH2C/bundle.json","state":"https://pith.science/pith/NRKEK4FTW5ATN2ZC7VWAT7FH2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRKEK4FTW5ATN2ZC7VWAT7FH2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NRKEK4FTW5ATN2ZC7VWAT7FH2C","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":"36363d177dead4004bf3900179796fd00433948e353e96d05e181f3ed532cb23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-21T14:28:44Z","title_canon_sha256":"97ee1c07e311c659a265fc4d05f7e2ad3261c7827c8b505747b53803aa04fdee"},"schema_version":"1.0","source":{"id":"1811.08750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08750","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08750v1","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08750","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"NRKEK4FTW5AT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NRKEK4FTW5ATN2ZC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NRKEK4FT","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:80d6226f258c51edcd7f710b2e0e76e0ed4e8b06a549f92df9d72e8b7b868742","target":"graph","created_at":"2026-05-18T00:00:11Z","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":"For graphs $G$ and $T$, and a family of graphs $\\mathcal{F}$ let $\\mathrm{ex}(G,T,\\mathcal{F})$ denote the maximum possible number of copies of $T$ in an $\\mathcal{F}$-free subgraph of $G$. We investigate the algorithmic aspects of calculating and estimating this function. We show that for every graph $T$, finite family $\\mathcal{F}$ and constant $\\epsilon>0$ there is a polynomial time algorithm that approximates $\\mathrm{ex}(G,T,\\mathcal{F})$ for an input graph $G$ on $n$ vertices up to an additive error of $\\epsilon n^{v(T)}$. We also consider the possibility of a better approximation, provi","authors_text":"Clara Shikhelman, Noga Alon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-21T14:28:44Z","title":"Additive Approximation of Generalized Tur\\'an Questions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08750","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:d3846bd19824ad3238135973e2bbb4dbcb11e127a3f23b1549011ed2c185c4eb","target":"record","created_at":"2026-05-18T00:00:11Z","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":"36363d177dead4004bf3900179796fd00433948e353e96d05e181f3ed532cb23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-21T14:28:44Z","title_canon_sha256":"97ee1c07e311c659a265fc4d05f7e2ad3261c7827c8b505747b53803aa04fdee"},"schema_version":"1.0","source":{"id":"1811.08750","kind":"arxiv","version":1}},"canonical_sha256":"6c544570b3b74136eb22fd6c09fca7d0a173089b1b7779fd9aea1029a05dc7ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c544570b3b74136eb22fd6c09fca7d0a173089b1b7779fd9aea1029a05dc7ff","first_computed_at":"2026-05-18T00:00:11.684920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:11.684920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"flG49nIArMPXUVxPMrvo2opg74e2ew/k4CLMLdMZE5VIF5q1AxnAL1QTQC3ScLfWlSVBLF87Qry6bOBlIiOzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:11.685579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3846bd19824ad3238135973e2bbb4dbcb11e127a3f23b1549011ed2c185c4eb","sha256:80d6226f258c51edcd7f710b2e0e76e0ed4e8b06a549f92df9d72e8b7b868742"],"state_sha256":"a7f9f093ded9c0afebffdb1fb3f5a742b9939276bb84046ce04a76b410cc3e9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihkMzmjyNjmkFnMla3C3boltXw+8C7J9BUIUx+2h7FxbE/jAglN6QDJ7NKIwddYCexPMuMBSCtWI90eP0tnOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:48:11.386351Z","bundle_sha256":"0ecd032b52b87720f0d3612730285c78e647dc0118cd78f3bfc36c0c9d620929"}}