{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TI5JCMEH7EGPLDJQVVS6ZIKW2V","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":"15fb28d8772bf66d2e56ebea78e3211e4490108a67d41b9f3905f4c9dbbf60a0","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2026-05-12T17:34:40Z","title_canon_sha256":"19b7544bfcdd2f9a73589c294b9a66afd5246cfbb61def0c992ced2445b67cf3"},"schema_version":"1.0","source":{"id":"2605.12439","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12439","created_at":"2026-06-19T16:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12439v2","created_at":"2026-06-19T16:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12439","created_at":"2026-06-19T16:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"TI5JCMEH7EGP","created_at":"2026-06-19T16:12:54Z"},{"alias_kind":"pith_short_16","alias_value":"TI5JCMEH7EGPLDJQ","created_at":"2026-06-19T16:12:54Z"},{"alias_kind":"pith_short_8","alias_value":"TI5JCMEH","created_at":"2026-06-19T16:12:54Z"}],"graph_snapshots":[{"event_id":"sha256:db89a73daae6a4388451dd8550c79ea775d04d1d565c214b41bd0fcacb314d1b","target":"graph","created_at":"2026-06-19T16:12:54Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We obtain ℓ^p improving estimates for the collection of forms based on all graphs with 2, 3, and 4 vertices, as well as chains and simplexes of any size in Z^d. Surprisingly, certain mapping properties only seem to depend on the number of vertices in the graph, not its structure."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The distance graphs are defined in Z^d with the standard Euclidean distances, and the multilinear forms satisfy the usual translation-invariance and Fourier multiplier properties assumed in prior spherical averaging work."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ℓ^p improving estimates are derived for multilinear forms from all distance graphs with 2, 3, or 4 vertices and from chains and simplexes of arbitrary size in Z^d, with some bounds depending only on vertex count rather than graph structure."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ℓ^p improving estimates for distance graph forms depend only on vertex count in many cases"}],"snapshot_sha256":"f6ec68075268ad3fd7e3e45174f1e3625edc910dfd640d82ef8696378b88db15"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"acc47c7cd1c998a103266864af68bb0bd9b97c7762439767d48356b89705f905"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-26T12:44:27.931904Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T13:01:24.889680Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T09:27:35.244563Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T22:21:57.839213Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.12439/integrity.json","findings":[],"snapshot_sha256":"c4c13e04c8ec1258e047020915de4dfab8a83cd401d0752909c4429f931877c7","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We undertake a systematic study of the mapping properties of forms based on distance graphs in $\\mathbb{Z}^{d}$ to see how the structure of a graph, $G$, affects the $\\ell^{p}$ improving estimates of the form, $\\Lambda_{G}$, based on $G$. This extends previous work on $\\ell^{p}$ improving properties for the spherical averaging operator, which corresponds to a distance graph of a single distance. We obtain $\\ell^{p}$ improving estimates for the collection of forms based on all graphs with 2, 3, and 4 vertices, as well as chains and simplexes of any size in $\\mathbb{Z}^{d}$. Surprisingly, certai","authors_text":"Eyvindur Palsson, Jennifer Smucker","cross_cats":["math.NT"],"headline":"ℓ^p improving estimates for distance graph forms depend only on vertex count in many cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2026-05-12T17:34:40Z","title":"$\\ell^{p}$ improving estimates for multilinear forms motivated by distance graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.12439","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T02:30:26.655930Z","id":"1f2537ed-ec6c-4ef9-a772-55574e284fa6","model_set":{"reader":"grok-4.3"},"one_line_summary":"ℓ^p improving estimates are derived for multilinear forms from all distance graphs with 2, 3, or 4 vertices and from chains and simplexes of arbitrary size in Z^d, with some bounds depending only on vertex count rather than graph structure.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ℓ^p improving estimates for distance graph forms depend only on vertex count in many cases","strongest_claim":"We obtain ℓ^p improving estimates for the collection of forms based on all graphs with 2, 3, and 4 vertices, as well as chains and simplexes of any size in Z^d. Surprisingly, certain mapping properties only seem to depend on the number of vertices in the graph, not its structure.","weakest_assumption":"The distance graphs are defined in Z^d with the standard Euclidean distances, and the multilinear forms satisfy the usual translation-invariance and Fourier multiplier properties assumed in prior spherical averaging work."}},"verdict_id":"1f2537ed-ec6c-4ef9-a772-55574e284fa6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b9385739597a86bcccea35f77fe6c2f2e7196cf0a6e19ee9fc2e77b2b538a806","target":"record","created_at":"2026-06-19T16:12:54Z","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":"15fb28d8772bf66d2e56ebea78e3211e4490108a67d41b9f3905f4c9dbbf60a0","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2026-05-12T17:34:40Z","title_canon_sha256":"19b7544bfcdd2f9a73589c294b9a66afd5246cfbb61def0c992ced2445b67cf3"},"schema_version":"1.0","source":{"id":"2605.12439","kind":"arxiv","version":2}},"canonical_sha256":"9a3a913087f90cf58d30ad65eca156d547309771d70a9e607a54b5edc7ace3f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a3a913087f90cf58d30ad65eca156d547309771d70a9e607a54b5edc7ace3f8","first_computed_at":"2026-06-19T16:12:54.894628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:54.894628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eb2IkmgU7hxroNHqlpH8SMGswA90WxlgE4v/wF/5jlyf+ZOCuRdmdvdtUZFkeq8GVa7qBj/jGqfRiV1YRaWeDQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:54.894987Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12439","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9385739597a86bcccea35f77fe6c2f2e7196cf0a6e19ee9fc2e77b2b538a806","sha256:db89a73daae6a4388451dd8550c79ea775d04d1d565c214b41bd0fcacb314d1b"],"state_sha256":"df4aba9b11c90fca2382984c7a412ba4fafbf5a3f80438bdcbe37730fedd67cc"}