{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:H4LFR7PCM33MJJTJQHGDAI43CT","short_pith_number":"pith:H4LFR7PC","canonical_record":{"source":{"id":"2606.09518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T14:08:27Z","cross_cats_sorted":[],"title_canon_sha256":"16d7f40441e03287636f653121b118c569b5fc3974220cf0be1a7d083322f159","abstract_canon_sha256":"005c147ba311b3e6631cdd06560003f1d2e367a74d1cc0466423318ad59537f7"},"schema_version":"1.0"},"canonical_sha256":"3f1658fde266f6c4a66981cc30239b14e80376dc68a115fee96eb35aa0e11aef","source":{"kind":"arxiv","id":"2606.09518","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09518","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09518v1","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09518","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"H4LFR7PCM33M","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"H4LFR7PCM33MJJTJ","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"H4LFR7PC","created_at":"2026-06-09T02:08:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:H4LFR7PCM33MJJTJQHGDAI43CT","target":"record","payload":{"canonical_record":{"source":{"id":"2606.09518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T14:08:27Z","cross_cats_sorted":[],"title_canon_sha256":"16d7f40441e03287636f653121b118c569b5fc3974220cf0be1a7d083322f159","abstract_canon_sha256":"005c147ba311b3e6631cdd06560003f1d2e367a74d1cc0466423318ad59537f7"},"schema_version":"1.0"},"canonical_sha256":"3f1658fde266f6c4a66981cc30239b14e80376dc68a115fee96eb35aa0e11aef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:53.039030Z","signature_b64":"yFDV+MQSbjrMAMQoqf9YVzauLuX+M2tFy14gag53o++EwkSozAmzDzDETQd+FfgzIRkTRYaefHwvPDySekvYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f1658fde266f6c4a66981cc30239b14e80376dc68a115fee96eb35aa0e11aef","last_reissued_at":"2026-06-09T02:08:53.038181Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:53.038181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.09518","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-06-09T02:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxXXBkTeuEynsKutSczaBe3oif9wpskFoCYNgZIiEf44DEc4UGkLqN8eAncdtAOJmxR4ziscHuywfKP9tR8YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:56:58.167363Z"},"content_sha256":"f8ae53316a5e805c0d96b4a5a8938603c4a03399235a2a007e49f6640a6d7737","schema_version":"1.0","event_id":"sha256:f8ae53316a5e805c0d96b4a5a8938603c4a03399235a2a007e49f6640a6d7737"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:H4LFR7PCM33MJJTJQHGDAI43CT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong counterexamples to a supersaturation question of Ma-Yuan","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Long-tu Yuan, Wanfang Chen","submitted_at":"2026-06-08T14:08:27Z","abstract_excerpt":"For a graph $F$, let $h_F(n,q)$ be the minimum number of copies of $F$ in an $n$-vertex graph with $\\mathrm{ex}(n,F)+q$ edges, where $\\mathrm{ex}(n,F)$ is the maximum number of edges in an $n$-vertex $F$-free graph. Let $c(n,F)$ be the minimum number of copies obtained by adding one edge to an extremal $F$-free graph. Mubayi's supersaturation conjecture predicts, under a stability hypothesis, that $h_F(n,q)\\ge q\\,c(n,F)$. Ma and Yuan recently constructed stable graph counterexamples for every fixed $q\\ge4$; they asked whether the one-edge equality $h_F(n,1)=c(n,F)$ might still hold for every g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09518","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.09518/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-09T02:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzc+UYe18XKQuPmPxjXf6kc9syJcrS/BmzavUzNh0mWrEu7TPLWAHZz02b9zsE9RLplzbQuS9kQKrky1PUqKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:56:58.167739Z"},"content_sha256":"628ffae1c24d1f80c6fc4f78eefeef195af7104db4e09b4edbce9dabba4fd7b1","schema_version":"1.0","event_id":"sha256:628ffae1c24d1f80c6fc4f78eefeef195af7104db4e09b4edbce9dabba4fd7b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4LFR7PCM33MJJTJQHGDAI43CT/bundle.json","state_url":"https://pith.science/pith/H4LFR7PCM33MJJTJQHGDAI43CT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4LFR7PCM33MJJTJQHGDAI43CT/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-28T14:56:58Z","links":{"resolver":"https://pith.science/pith/H4LFR7PCM33MJJTJQHGDAI43CT","bundle":"https://pith.science/pith/H4LFR7PCM33MJJTJQHGDAI43CT/bundle.json","state":"https://pith.science/pith/H4LFR7PCM33MJJTJQHGDAI43CT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4LFR7PCM33MJJTJQHGDAI43CT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:H4LFR7PCM33MJJTJQHGDAI43CT","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":"005c147ba311b3e6631cdd06560003f1d2e367a74d1cc0466423318ad59537f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T14:08:27Z","title_canon_sha256":"16d7f40441e03287636f653121b118c569b5fc3974220cf0be1a7d083322f159"},"schema_version":"1.0","source":{"id":"2606.09518","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09518","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09518v1","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09518","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"H4LFR7PCM33M","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"H4LFR7PCM33MJJTJ","created_at":"2026-06-09T02:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"H4LFR7PC","created_at":"2026-06-09T02:08:53Z"}],"graph_snapshots":[{"event_id":"sha256:628ffae1c24d1f80c6fc4f78eefeef195af7104db4e09b4edbce9dabba4fd7b1","target":"graph","created_at":"2026-06-09T02:08:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.09518/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a graph $F$, let $h_F(n,q)$ be the minimum number of copies of $F$ in an $n$-vertex graph with $\\mathrm{ex}(n,F)+q$ edges, where $\\mathrm{ex}(n,F)$ is the maximum number of edges in an $n$-vertex $F$-free graph. Let $c(n,F)$ be the minimum number of copies obtained by adding one edge to an extremal $F$-free graph. Mubayi's supersaturation conjecture predicts, under a stability hypothesis, that $h_F(n,q)\\ge q\\,c(n,F)$. Ma and Yuan recently constructed stable graph counterexamples for every fixed $q\\ge4$; they asked whether the one-edge equality $h_F(n,1)=c(n,F)$ might still hold for every g","authors_text":"Long-tu Yuan, Wanfang Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T14:08:27Z","title":"Strong counterexamples to a supersaturation question of Ma-Yuan"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09518","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:f8ae53316a5e805c0d96b4a5a8938603c4a03399235a2a007e49f6640a6d7737","target":"record","created_at":"2026-06-09T02:08:53Z","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":"005c147ba311b3e6631cdd06560003f1d2e367a74d1cc0466423318ad59537f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T14:08:27Z","title_canon_sha256":"16d7f40441e03287636f653121b118c569b5fc3974220cf0be1a7d083322f159"},"schema_version":"1.0","source":{"id":"2606.09518","kind":"arxiv","version":1}},"canonical_sha256":"3f1658fde266f6c4a66981cc30239b14e80376dc68a115fee96eb35aa0e11aef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f1658fde266f6c4a66981cc30239b14e80376dc68a115fee96eb35aa0e11aef","first_computed_at":"2026-06-09T02:08:53.038181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:08:53.038181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yFDV+MQSbjrMAMQoqf9YVzauLuX+M2tFy14gag53o++EwkSozAmzDzDETQd+FfgzIRkTRYaefHwvPDySekvYBw==","signature_status":"signed_v1","signed_at":"2026-06-09T02:08:53.039030Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.09518","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8ae53316a5e805c0d96b4a5a8938603c4a03399235a2a007e49f6640a6d7737","sha256:628ffae1c24d1f80c6fc4f78eefeef195af7104db4e09b4edbce9dabba4fd7b1"],"state_sha256":"d77dcf16e733ef38583f2b3ca780c55a0178b3d87f763c89abf9840e7c534c52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M59qHEjGQ/9lLempAH5bFEQFnv8QPDLxAre34EWTDnU2tlJhRZDmF9gDlrrOVfyDwrgBcBvrYxZ6KNZweAnjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:56:58.170168Z","bundle_sha256":"c0f2325b3b9305a4206ecc14a0955d3f211d8d6bf6de57a64fefb39d8e7329d9"}}