{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2OW2PAXCZYUHCKBGU5654PI3HJ","short_pith_number":"pith:2OW2PAXC","schema_version":"1.0","canonical_sha256":"d3ada782e2ce28712826a77dde3d1b3a7a1516d11f2d6f249bf2cdc7d49b47ca","source":{"kind":"arxiv","id":"1410.6204","version":1},"attestation_state":"computed","paper":{"title":"Best constants for the Hardy-Littlewood maximal operator on finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.CO","authors_text":"Javier Soria, Pedro Tradacete","submitted_at":"2014-10-22T22:06:30Z","abstract_excerpt":"We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$ completely determines $G$ (even though embedding properties for the graphs do not imply pointwise inequalities for the maximal operators). Optimal bounds for the $p$-(quasi)norm of a general graph $G$ in the range $0<p\\le1$ are given, and it is shown that the complete graph $K_n$ and the star graph $S_n$ are the extremal graphs attaining, respectively, the "},"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":"1410.6204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-22T22:06:30Z","cross_cats_sorted":["math.CA"],"title_canon_sha256":"fc142be80e583efb4cf2ded78e1e8bde7ae505a01ecaa96e955cd209e3cf9f98","abstract_canon_sha256":"c9caf8794fcdbb90fe6c9c2e65fda226deed23e95589d15431d8b873dff2e0a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:31.378950Z","signature_b64":"iAxxFJwOFRSkJmKEVH+MG0sYmuiwY+EXP7aQiQ+R8BONkWMdia+ZoNdGHphTUX4dD0FFTk260fm7YN3zDNNbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3ada782e2ce28712826a77dde3d1b3a7a1516d11f2d6f249bf2cdc7d49b47ca","last_reissued_at":"2026-05-18T02:39:31.378333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:31.378333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best constants for the Hardy-Littlewood maximal operator on finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.CO","authors_text":"Javier Soria, Pedro Tradacete","submitted_at":"2014-10-22T22:06:30Z","abstract_excerpt":"We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$ completely determines $G$ (even though embedding properties for the graphs do not imply pointwise inequalities for the maximal operators). Optimal bounds for the $p$-(quasi)norm of a general graph $G$ in the range $0<p\\le1$ are given, and it is shown that the complete graph $K_n$ and the star graph $S_n$ are the extremal graphs attaining, respectively, the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6204","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":""},"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":"1410.6204","created_at":"2026-05-18T02:39:31.378424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6204v1","created_at":"2026-05-18T02:39:31.378424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6204","created_at":"2026-05-18T02:39:31.378424+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OW2PAXCZYUH","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OW2PAXCZYUHCKBG","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OW2PAXC","created_at":"2026-05-18T12:28:11.866339+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/2OW2PAXCZYUHCKBGU5654PI3HJ","json":"https://pith.science/pith/2OW2PAXCZYUHCKBGU5654PI3HJ.json","graph_json":"https://pith.science/api/pith-number/2OW2PAXCZYUHCKBGU5654PI3HJ/graph.json","events_json":"https://pith.science/api/pith-number/2OW2PAXCZYUHCKBGU5654PI3HJ/events.json","paper":"https://pith.science/paper/2OW2PAXC"},"agent_actions":{"view_html":"https://pith.science/pith/2OW2PAXCZYUHCKBGU5654PI3HJ","download_json":"https://pith.science/pith/2OW2PAXCZYUHCKBGU5654PI3HJ.json","view_paper":"https://pith.science/paper/2OW2PAXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6204&json=true","fetch_graph":"https://pith.science/api/pith-number/2OW2PAXCZYUHCKBGU5654PI3HJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2OW2PAXCZYUHCKBGU5654PI3HJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OW2PAXCZYUHCKBGU5654PI3HJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OW2PAXCZYUHCKBGU5654PI3HJ/action/storage_attestation","attest_author":"https://pith.science/pith/2OW2PAXCZYUHCKBGU5654PI3HJ/action/author_attestation","sign_citation":"https://pith.science/pith/2OW2PAXCZYUHCKBGU5654PI3HJ/action/citation_signature","submit_replication":"https://pith.science/pith/2OW2PAXCZYUHCKBGU5654PI3HJ/action/replication_record"}},"created_at":"2026-05-18T02:39:31.378424+00:00","updated_at":"2026-05-18T02:39:31.378424+00:00"}