{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q2KZ2EQTOGWHZLO4XMIPMJZN2Y","short_pith_number":"pith:Q2KZ2EQT","canonical_record":{"source":{"id":"2606.23737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T08:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"4acd97a9e900ccb2a0ac43d0c17e7a32896594eecc3085f830f6224fd3fdc91c","abstract_canon_sha256":"405dd47f4383ec41d4145137141391f9c65339c6f4b8a0786bc650ea020cb596"},"schema_version":"1.0"},"canonical_sha256":"86959d121371ac7caddcbb10f6272dd63b98573501dbe66e549fd06092619081","source":{"kind":"arxiv","id":"2606.23737","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23737","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23737v1","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23737","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"Q2KZ2EQTOGWH","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q2KZ2EQTOGWHZLO4","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q2KZ2EQT","created_at":"2026-06-24T00:14:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q2KZ2EQTOGWHZLO4XMIPMJZN2Y","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T08:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"4acd97a9e900ccb2a0ac43d0c17e7a32896594eecc3085f830f6224fd3fdc91c","abstract_canon_sha256":"405dd47f4383ec41d4145137141391f9c65339c6f4b8a0786bc650ea020cb596"},"schema_version":"1.0"},"canonical_sha256":"86959d121371ac7caddcbb10f6272dd63b98573501dbe66e549fd06092619081","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:24.599487Z","signature_b64":"xGkWPj4wXVyBvaEFgp/lG0kFOsyjs1aaABkzsSWsHrZrBtc3KLoyOm4nwCn/aaZK6ozkpm4eU6ta9MgETR+FAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86959d121371ac7caddcbb10f6272dd63b98573501dbe66e549fd06092619081","last_reissued_at":"2026-06-24T00:14:24.599075Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:24.599075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23737","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-24T00:14:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20++YvR9pURUhShNJMm5hsa5CaqhMRsMjXE/LYjNBdFgrLuNKl1Y/4VeLiD2X+Q7Ob5e0ybaglY9dZ2zb93aDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:20:02.821651Z"},"content_sha256":"ab14f25f6a573224c02ebca4e3c6e477643eb73b36a7de56d20f7dac5cb5a146","schema_version":"1.0","event_id":"sha256:ab14f25f6a573224c02ebca4e3c6e477643eb73b36a7de56d20f7dac5cb5a146"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q2KZ2EQTOGWHZLO4XMIPMJZN2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-Kernel Extremizers in Sparse Extremal Graph Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiasheng Zeng","submitted_at":"2026-06-21T08:03:29Z","abstract_excerpt":"We develop a finite-kernel framework for sparse extremal graph counting. The problems considered here ask for the maximum number of copies or homomorphisms of a fixed graph under sparse edge constraints. In this regime, the leading term need not be governed by a single dense block. Instead, the extremal mass may be supported on several interacting asymptotic scales. Our framework identifies these scales via a finite-dimensional linear program, separates the leading contributions through a finite state decomposition, and synchronizes or realizes them inside a finite kernel.\n  We apply this fram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23737","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.23737/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-24T00:14:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URCtP8IN/NOK6jNHop2XoCIX/PNrdQwTsH+08kfgYQqfO7WiIYj9HC1ajimBv1oDFmlvUG9yYhg9k0KPWCXfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:20:02.822024Z"},"content_sha256":"08723fab9a222e627f07b860734e1218f9a80dfe7ad852877e2f6d9fe806660e","schema_version":"1.0","event_id":"sha256:08723fab9a222e627f07b860734e1218f9a80dfe7ad852877e2f6d9fe806660e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/bundle.json","state_url":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/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-29T12:20:02Z","links":{"resolver":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y","bundle":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/bundle.json","state":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q2KZ2EQTOGWHZLO4XMIPMJZN2Y","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":"405dd47f4383ec41d4145137141391f9c65339c6f4b8a0786bc650ea020cb596","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T08:03:29Z","title_canon_sha256":"4acd97a9e900ccb2a0ac43d0c17e7a32896594eecc3085f830f6224fd3fdc91c"},"schema_version":"1.0","source":{"id":"2606.23737","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23737","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23737v1","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23737","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_12","alias_value":"Q2KZ2EQTOGWH","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q2KZ2EQTOGWHZLO4","created_at":"2026-06-24T00:14:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q2KZ2EQT","created_at":"2026-06-24T00:14:24Z"}],"graph_snapshots":[{"event_id":"sha256:08723fab9a222e627f07b860734e1218f9a80dfe7ad852877e2f6d9fe806660e","target":"graph","created_at":"2026-06-24T00:14:24Z","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.23737/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop a finite-kernel framework for sparse extremal graph counting. The problems considered here ask for the maximum number of copies or homomorphisms of a fixed graph under sparse edge constraints. In this regime, the leading term need not be governed by a single dense block. Instead, the extremal mass may be supported on several interacting asymptotic scales. Our framework identifies these scales via a finite-dimensional linear program, separates the leading contributions through a finite state decomposition, and synchronizes or realizes them inside a finite kernel.\n  We apply this fram","authors_text":"Jiasheng Zeng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T08:03:29Z","title":"Finite-Kernel Extremizers in Sparse Extremal Graph Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23737","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:ab14f25f6a573224c02ebca4e3c6e477643eb73b36a7de56d20f7dac5cb5a146","target":"record","created_at":"2026-06-24T00:14:24Z","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":"405dd47f4383ec41d4145137141391f9c65339c6f4b8a0786bc650ea020cb596","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T08:03:29Z","title_canon_sha256":"4acd97a9e900ccb2a0ac43d0c17e7a32896594eecc3085f830f6224fd3fdc91c"},"schema_version":"1.0","source":{"id":"2606.23737","kind":"arxiv","version":1}},"canonical_sha256":"86959d121371ac7caddcbb10f6272dd63b98573501dbe66e549fd06092619081","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86959d121371ac7caddcbb10f6272dd63b98573501dbe66e549fd06092619081","first_computed_at":"2026-06-24T00:14:24.599075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T00:14:24.599075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xGkWPj4wXVyBvaEFgp/lG0kFOsyjs1aaABkzsSWsHrZrBtc3KLoyOm4nwCn/aaZK6ozkpm4eU6ta9MgETR+FAw==","signature_status":"signed_v1","signed_at":"2026-06-24T00:14:24.599487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23737","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab14f25f6a573224c02ebca4e3c6e477643eb73b36a7de56d20f7dac5cb5a146","sha256:08723fab9a222e627f07b860734e1218f9a80dfe7ad852877e2f6d9fe806660e"],"state_sha256":"936e0defe1ce6900ebbb6a3d1440aacfee9fbcc86edec5b32896a6c4f9b2e775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzqOB3cM6eeRYxE1CdvoRGwnAgFEd5lBH9vfLUBNEt7cijkSs2jycTmi9nblyHNusUiwpUjfKJsboZDycQnNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T12:20:02.823952Z","bundle_sha256":"e9452c5d1e000307d4fcd7c33f7db0e31f0611d18db6bfb3cdfde4477da2fd66"}}