{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y2QK6WAHK7UWDTDIXRSRJ52XBJ","short_pith_number":"pith:Y2QK6WAH","schema_version":"1.0","canonical_sha256":"c6a0af580757e961cc68bc6514f7570a7d3d0ddc4f2016ad8d8993bc4fc2fe8f","source":{"kind":"arxiv","id":"1509.09200","version":1},"attestation_state":"computed","paper":{"title":"Four variants of the Fourier-analytic transference principle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Sean Prendiville","submitted_at":"2015-09-30T14:49:49Z","abstract_excerpt":"We survey four instances of the Fourier analytic 'transference principle' or 'dense model lemma', which allows one to approximate an unbounded function on the integers by a bounded function with similar Fourier transform. Such a result forms a component of a general method pioneered by Green to count solutions to a single linear equation in a sparse subset of integers."},"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":"1509.09200","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2015-09-30T14:49:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"caa7143dfb483d1ad36ef89a26ef6071c7caf47a18cdff981e333c706bad3490","abstract_canon_sha256":"c25c2f2a7abd533e6d073c974e115b94af24944f6aaae3b4254b5a7e4c147301"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:26.840811Z","signature_b64":"momO8nGs5Ij24j4NCfAkPaXpkFryzOf9DsGYfTeeuO2641XZxPbWupLZUqc989xK7xyJlJfhS8GfZaLBnjosCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a0af580757e961cc68bc6514f7570a7d3d0ddc4f2016ad8d8993bc4fc2fe8f","last_reissued_at":"2026-05-18T01:31:26.840246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:26.840246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Four variants of the Fourier-analytic transference principle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Sean Prendiville","submitted_at":"2015-09-30T14:49:49Z","abstract_excerpt":"We survey four instances of the Fourier analytic 'transference principle' or 'dense model lemma', which allows one to approximate an unbounded function on the integers by a bounded function with similar Fourier transform. Such a result forms a component of a general method pioneered by Green to count solutions to a single linear equation in a sparse subset of integers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09200","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":"1509.09200","created_at":"2026-05-18T01:31:26.840328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.09200v1","created_at":"2026-05-18T01:31:26.840328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09200","created_at":"2026-05-18T01:31:26.840328+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2QK6WAHK7UW","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2QK6WAHK7UWDTDI","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2QK6WAH","created_at":"2026-05-18T12:29:50.041715+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/Y2QK6WAHK7UWDTDIXRSRJ52XBJ","json":"https://pith.science/pith/Y2QK6WAHK7UWDTDIXRSRJ52XBJ.json","graph_json":"https://pith.science/api/pith-number/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/graph.json","events_json":"https://pith.science/api/pith-number/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/events.json","paper":"https://pith.science/paper/Y2QK6WAH"},"agent_actions":{"view_html":"https://pith.science/pith/Y2QK6WAHK7UWDTDIXRSRJ52XBJ","download_json":"https://pith.science/pith/Y2QK6WAHK7UWDTDIXRSRJ52XBJ.json","view_paper":"https://pith.science/paper/Y2QK6WAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.09200&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/action/storage_attestation","attest_author":"https://pith.science/pith/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/action/author_attestation","sign_citation":"https://pith.science/pith/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/action/citation_signature","submit_replication":"https://pith.science/pith/Y2QK6WAHK7UWDTDIXRSRJ52XBJ/action/replication_record"}},"created_at":"2026-05-18T01:31:26.840328+00:00","updated_at":"2026-05-18T01:31:26.840328+00:00"}