{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Q2KZ2EQTOGWHZLO4XMIPMJZN2Y","short_pith_number":"pith:Q2KZ2EQT","schema_version":"1.0","canonical_sha256":"86959d121371ac7caddcbb10f6272dd63b98573501dbe66e549fd06092619081","source":{"kind":"arxiv","id":"2606.23737","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.23737","created_at":"2026-06-24T00:14:24.599139+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23737v1","created_at":"2026-06-24T00:14:24.599139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23737","created_at":"2026-06-24T00:14:24.599139+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2KZ2EQTOGWH","created_at":"2026-06-24T00:14:24.599139+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2KZ2EQTOGWHZLO4","created_at":"2026-06-24T00:14:24.599139+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2KZ2EQT","created_at":"2026-06-24T00:14:24.599139+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/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y","json":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y.json","graph_json":"https://pith.science/api/pith-number/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/graph.json","events_json":"https://pith.science/api/pith-number/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/events.json","paper":"https://pith.science/paper/Q2KZ2EQT"},"agent_actions":{"view_html":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y","download_json":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y.json","view_paper":"https://pith.science/paper/Q2KZ2EQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23737&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/action/storage_attestation","attest_author":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/action/author_attestation","sign_citation":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/action/citation_signature","submit_replication":"https://pith.science/pith/Q2KZ2EQTOGWHZLO4XMIPMJZN2Y/action/replication_record"}},"created_at":"2026-06-24T00:14:24.599139+00:00","updated_at":"2026-06-24T00:14:24.599139+00:00"}