{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GLLP3GJJEGW6E4I22OAGG63NRO","short_pith_number":"pith:GLLP3GJJ","schema_version":"1.0","canonical_sha256":"32d6fd992921ade2711ad380637b6d8b924a98c881b021548fbf7dc71f2bedf3","source":{"kind":"arxiv","id":"1702.04717","version":1},"attestation_state":"computed","paper":{"title":"A quaternary diophantine inequality by prime numbers of a special type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"S. I. Dimitrov","submitted_at":"2017-02-15T11:23:08Z","abstract_excerpt":"Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\\vartheta>0$, the inequality \\begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\\vartheta \\end{equation*} has a solution in prime numbers $p_1,\\,p_2,\\,p_3,\\,p_4$ such that, for each $i\\in\\{1,2,3,4\\}$, $p_i+2$ has at most $32$ prime factors."},"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":"1702.04717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-15T11:23:08Z","cross_cats_sorted":[],"title_canon_sha256":"ac8e0f4935c23bf77e2c48d0d9fbfa7165f893dd7cb5b199f334124058a4fefd","abstract_canon_sha256":"d4ecbc3c831a8ba42b476f6a322bf714e6108b662e2f858de876fc07fb8ee823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:37.232629Z","signature_b64":"Whm8nELfrLwnbIVzuVi5NSm9UhBEs4ts/tAVYeTUo73UICy1ofHREITuIq2/DPh5q7yeET4DsTPkFZcK6skyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32d6fd992921ade2711ad380637b6d8b924a98c881b021548fbf7dc71f2bedf3","last_reissued_at":"2026-05-18T00:50:37.231973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:37.231973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quaternary diophantine inequality by prime numbers of a special type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"S. I. Dimitrov","submitted_at":"2017-02-15T11:23:08Z","abstract_excerpt":"Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\\vartheta>0$, the inequality \\begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\\vartheta \\end{equation*} has a solution in prime numbers $p_1,\\,p_2,\\,p_3,\\,p_4$ such that, for each $i\\in\\{1,2,3,4\\}$, $p_i+2$ has at most $32$ prime factors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04717","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":"1702.04717","created_at":"2026-05-18T00:50:37.232073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04717v1","created_at":"2026-05-18T00:50:37.232073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04717","created_at":"2026-05-18T00:50:37.232073+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLLP3GJJEGW6","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLLP3GJJEGW6E4I2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLLP3GJJ","created_at":"2026-05-18T12:31:18.294218+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/GLLP3GJJEGW6E4I22OAGG63NRO","json":"https://pith.science/pith/GLLP3GJJEGW6E4I22OAGG63NRO.json","graph_json":"https://pith.science/api/pith-number/GLLP3GJJEGW6E4I22OAGG63NRO/graph.json","events_json":"https://pith.science/api/pith-number/GLLP3GJJEGW6E4I22OAGG63NRO/events.json","paper":"https://pith.science/paper/GLLP3GJJ"},"agent_actions":{"view_html":"https://pith.science/pith/GLLP3GJJEGW6E4I22OAGG63NRO","download_json":"https://pith.science/pith/GLLP3GJJEGW6E4I22OAGG63NRO.json","view_paper":"https://pith.science/paper/GLLP3GJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04717&json=true","fetch_graph":"https://pith.science/api/pith-number/GLLP3GJJEGW6E4I22OAGG63NRO/graph.json","fetch_events":"https://pith.science/api/pith-number/GLLP3GJJEGW6E4I22OAGG63NRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLLP3GJJEGW6E4I22OAGG63NRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLLP3GJJEGW6E4I22OAGG63NRO/action/storage_attestation","attest_author":"https://pith.science/pith/GLLP3GJJEGW6E4I22OAGG63NRO/action/author_attestation","sign_citation":"https://pith.science/pith/GLLP3GJJEGW6E4I22OAGG63NRO/action/citation_signature","submit_replication":"https://pith.science/pith/GLLP3GJJEGW6E4I22OAGG63NRO/action/replication_record"}},"created_at":"2026-05-18T00:50:37.232073+00:00","updated_at":"2026-05-18T00:50:37.232073+00:00"}