{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7YR44VHH2W3U3XHTG6TOG7YMAU","short_pith_number":"pith:7YR44VHH","schema_version":"1.0","canonical_sha256":"fe23ce54e7d5b74ddcf337a6e37f0c050c056f60acdee3f0f85cab587403fb5d","source":{"kind":"arxiv","id":"1710.01471","version":2},"attestation_state":"computed","paper":{"title":"Supersaturation Problem for the Bowtie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mihyun Kang, Oleg Pikhurko, Tam\\'as Makai","submitted_at":"2017-10-04T06:14:15Z","abstract_excerpt":"The Tur\\'an function $ex(n,F)$ denotes the maximal number of edges in an $F$-free graph on $n$ vertices. We consider the function $h_F(n,q)$, the minimal number of copies of $F$ in a graph on $n$ vertices with $ex(n,F)+q$ edges. The value of $h_F(n,q)$ has been extensively studied when $F$ is bipartite or colour-critical. In this paper we investigate the simplest remaining graph $F$, namely, two triangles sharing a vertex, and establish the asymptotic value of $h_F(n,q)$ for $q=o(n^2)$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1710.01471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-04T06:14:15Z","cross_cats_sorted":[],"title_canon_sha256":"aa285cbf64c875e71d0ee6aa974cf2aa64ce30c9924ac048c0e27340ea4698c3","abstract_canon_sha256":"f9f60a2e93c00ae82e59b29732fd359529778cebd065822a5e9ead1c04973f57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:28.778355Z","signature_b64":"8SMhQQpAU7wj/MLLMUFMbJfJ4vQK40affy/ayTwXE33vXNtmCuuvwEdKE+8MbdqmkoM7+7iekF6wPvkNQ6hZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe23ce54e7d5b74ddcf337a6e37f0c050c056f60acdee3f0f85cab587403fb5d","last_reissued_at":"2026-05-17T23:50:28.777821Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:28.777821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supersaturation Problem for the Bowtie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mihyun Kang, Oleg Pikhurko, Tam\\'as Makai","submitted_at":"2017-10-04T06:14:15Z","abstract_excerpt":"The Tur\\'an function $ex(n,F)$ denotes the maximal number of edges in an $F$-free graph on $n$ vertices. We consider the function $h_F(n,q)$, the minimal number of copies of $F$ in a graph on $n$ vertices with $ex(n,F)+q$ edges. The value of $h_F(n,q)$ has been extensively studied when $F$ is bipartite or colour-critical. In this paper we investigate the simplest remaining graph $F$, namely, two triangles sharing a vertex, and establish the asymptotic value of $h_F(n,q)$ for $q=o(n^2)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01471","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.01471","created_at":"2026-05-17T23:50:28.777900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01471v2","created_at":"2026-05-17T23:50:28.777900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01471","created_at":"2026-05-17T23:50:28.777900+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YR44VHH2W3U","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YR44VHH2W3U3XHT","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YR44VHH","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU","json":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU.json","graph_json":"https://pith.science/api/pith-number/7YR44VHH2W3U3XHTG6TOG7YMAU/graph.json","events_json":"https://pith.science/api/pith-number/7YR44VHH2W3U3XHTG6TOG7YMAU/events.json","paper":"https://pith.science/paper/7YR44VHH"},"agent_actions":{"view_html":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU","download_json":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU.json","view_paper":"https://pith.science/paper/7YR44VHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01471&json=true","fetch_graph":"https://pith.science/api/pith-number/7YR44VHH2W3U3XHTG6TOG7YMAU/graph.json","fetch_events":"https://pith.science/api/pith-number/7YR44VHH2W3U3XHTG6TOG7YMAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU/action/storage_attestation","attest_author":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU/action/author_attestation","sign_citation":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU/action/citation_signature","submit_replication":"https://pith.science/pith/7YR44VHH2W3U3XHTG6TOG7YMAU/action/replication_record"}},"created_at":"2026-05-17T23:50:28.777900+00:00","updated_at":"2026-05-17T23:50:28.777900+00:00"}