{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HB6BSHBAHWNDR2L774XYS3RDFS","short_pith_number":"pith:HB6BSHBA","schema_version":"1.0","canonical_sha256":"387c191c203d9a38e97fff2f896e232cb75f3390aa2e26021d69f76db62cdb6f","source":{"kind":"arxiv","id":"2605.25238","version":1},"attestation_state":"computed","paper":{"title":"Optimal discrete $p$-Hardy-Rellich-Birman inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CA","authors_text":"Franti\\v{s}ek \\v{S}tampach, Jakub Waclawek","submitted_at":"2026-05-24T19:47:58Z","abstract_excerpt":"We present a theory for constructing optimal lower bounds for the discrete half-line $p$-Laplacian of higher order $\\ell\\in\\mathbb{N}$ and general $p>1$. The abstract framework introduces higher-order monotonicity and asymptotic constraints on a parameter sequence that determines optimal weights. As a concrete application, we specialize the parameter sequence to deduce new optimal discrete $p$-Hardy ($\\ell=1$), $p$-Rellich ($\\ell=2$), and $p$-Birman ($\\ell\\geq 3$) inequalities."},"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":"2605.25238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2026-05-24T19:47:58Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"13ea6d1f2eabce26234954523aeda2bc142e34958d34eac01f91b121d068b0ac","abstract_canon_sha256":"2ba0b69c9fec3e4cb83f5b8d2b43005b05502e46d777ed683bf45166f3eca851"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:24.608793Z","signature_b64":"Zz1ozOEFara7uNGE9Wd2VqA8LP066p1Bvkg+w+40KbHOBK7v0mmC4Vek9CWhVF6YHykggbBvd9wxDP9n1or0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"387c191c203d9a38e97fff2f896e232cb75f3390aa2e26021d69f76db62cdb6f","last_reissued_at":"2026-05-26T02:04:24.608025Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:24.608025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal discrete $p$-Hardy-Rellich-Birman inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CA","authors_text":"Franti\\v{s}ek \\v{S}tampach, Jakub Waclawek","submitted_at":"2026-05-24T19:47:58Z","abstract_excerpt":"We present a theory for constructing optimal lower bounds for the discrete half-line $p$-Laplacian of higher order $\\ell\\in\\mathbb{N}$ and general $p>1$. The abstract framework introduces higher-order monotonicity and asymptotic constraints on a parameter sequence that determines optimal weights. As a concrete application, we specialize the parameter sequence to deduce new optimal discrete $p$-Hardy ($\\ell=1$), $p$-Rellich ($\\ell=2$), and $p$-Birman ($\\ell\\geq 3$) inequalities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25238","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/2605.25238/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":"2605.25238","created_at":"2026-05-26T02:04:24.608157+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25238v1","created_at":"2026-05-26T02:04:24.608157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25238","created_at":"2026-05-26T02:04:24.608157+00:00"},{"alias_kind":"pith_short_12","alias_value":"HB6BSHBAHWND","created_at":"2026-05-26T02:04:24.608157+00:00"},{"alias_kind":"pith_short_16","alias_value":"HB6BSHBAHWNDR2L7","created_at":"2026-05-26T02:04:24.608157+00:00"},{"alias_kind":"pith_short_8","alias_value":"HB6BSHBA","created_at":"2026-05-26T02:04:24.608157+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/HB6BSHBAHWNDR2L774XYS3RDFS","json":"https://pith.science/pith/HB6BSHBAHWNDR2L774XYS3RDFS.json","graph_json":"https://pith.science/api/pith-number/HB6BSHBAHWNDR2L774XYS3RDFS/graph.json","events_json":"https://pith.science/api/pith-number/HB6BSHBAHWNDR2L774XYS3RDFS/events.json","paper":"https://pith.science/paper/HB6BSHBA"},"agent_actions":{"view_html":"https://pith.science/pith/HB6BSHBAHWNDR2L774XYS3RDFS","download_json":"https://pith.science/pith/HB6BSHBAHWNDR2L774XYS3RDFS.json","view_paper":"https://pith.science/paper/HB6BSHBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25238&json=true","fetch_graph":"https://pith.science/api/pith-number/HB6BSHBAHWNDR2L774XYS3RDFS/graph.json","fetch_events":"https://pith.science/api/pith-number/HB6BSHBAHWNDR2L774XYS3RDFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HB6BSHBAHWNDR2L774XYS3RDFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HB6BSHBAHWNDR2L774XYS3RDFS/action/storage_attestation","attest_author":"https://pith.science/pith/HB6BSHBAHWNDR2L774XYS3RDFS/action/author_attestation","sign_citation":"https://pith.science/pith/HB6BSHBAHWNDR2L774XYS3RDFS/action/citation_signature","submit_replication":"https://pith.science/pith/HB6BSHBAHWNDR2L774XYS3RDFS/action/replication_record"}},"created_at":"2026-05-26T02:04:24.608157+00:00","updated_at":"2026-05-26T02:04:24.608157+00:00"}