{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3IQ4QKWJTJRVQLJGXUI2RF4YN2","short_pith_number":"pith:3IQ4QKWJ","schema_version":"1.0","canonical_sha256":"da21c82ac99a63582d26bd11a897986e9032e05eb3a46a58d391903b5a953827","source":{"kind":"arxiv","id":"1511.03232","version":1},"attestation_state":"computed","paper":{"title":"On Integer sequences in Product sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Sai Teja Somu","submitted_at":"2015-11-10T19:27:57Z","abstract_excerpt":"Let $B$ be a finite set of natural numbers or complex numbers. Product set corresponding to $B$ is defined by $B.B:=\\{ab:a,b\\in B\\}$. In this paper we give an upper bound for longest length of consecutive terms of a polynomial sequence present in a product set accurate up to a positive constant. We give a sharp bound on the maximum number of Fibonacci numbers present in a product set when $B$ is a set of natural numbers and a bound which is accurate up to a positive constant when $B$ is a set of complex numbers."},"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":"1511.03232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-10T19:27:57Z","cross_cats_sorted":[],"title_canon_sha256":"ce0d6b37698e7a54254ef2769214597530fc173f34643371a303a1b9e3daf4fe","abstract_canon_sha256":"28be6d35f1f8be9242c6a7fa247b782e815b3f3ed79d8f5c86111af38a2610b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:16.722484Z","signature_b64":"ZuEXaPGtdUJlW44mptmVDE/8uTLDJlWLbDTtxlpHx+vzY7Yh8epeXnFhpUmLrYEy3MCtH7fHnyNIu4pyJoemBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da21c82ac99a63582d26bd11a897986e9032e05eb3a46a58d391903b5a953827","last_reissued_at":"2026-05-18T01:27:16.722006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:16.722006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Integer sequences in Product sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Sai Teja Somu","submitted_at":"2015-11-10T19:27:57Z","abstract_excerpt":"Let $B$ be a finite set of natural numbers or complex numbers. Product set corresponding to $B$ is defined by $B.B:=\\{ab:a,b\\in B\\}$. In this paper we give an upper bound for longest length of consecutive terms of a polynomial sequence present in a product set accurate up to a positive constant. We give a sharp bound on the maximum number of Fibonacci numbers present in a product set when $B$ is a set of natural numbers and a bound which is accurate up to a positive constant when $B$ is a set of complex numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03232","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":"1511.03232","created_at":"2026-05-18T01:27:16.722078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03232v1","created_at":"2026-05-18T01:27:16.722078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03232","created_at":"2026-05-18T01:27:16.722078+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IQ4QKWJTJRV","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IQ4QKWJTJRVQLJG","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IQ4QKWJ","created_at":"2026-05-18T12:29:02.477457+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/3IQ4QKWJTJRVQLJGXUI2RF4YN2","json":"https://pith.science/pith/3IQ4QKWJTJRVQLJGXUI2RF4YN2.json","graph_json":"https://pith.science/api/pith-number/3IQ4QKWJTJRVQLJGXUI2RF4YN2/graph.json","events_json":"https://pith.science/api/pith-number/3IQ4QKWJTJRVQLJGXUI2RF4YN2/events.json","paper":"https://pith.science/paper/3IQ4QKWJ"},"agent_actions":{"view_html":"https://pith.science/pith/3IQ4QKWJTJRVQLJGXUI2RF4YN2","download_json":"https://pith.science/pith/3IQ4QKWJTJRVQLJGXUI2RF4YN2.json","view_paper":"https://pith.science/paper/3IQ4QKWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03232&json=true","fetch_graph":"https://pith.science/api/pith-number/3IQ4QKWJTJRVQLJGXUI2RF4YN2/graph.json","fetch_events":"https://pith.science/api/pith-number/3IQ4QKWJTJRVQLJGXUI2RF4YN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IQ4QKWJTJRVQLJGXUI2RF4YN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IQ4QKWJTJRVQLJGXUI2RF4YN2/action/storage_attestation","attest_author":"https://pith.science/pith/3IQ4QKWJTJRVQLJGXUI2RF4YN2/action/author_attestation","sign_citation":"https://pith.science/pith/3IQ4QKWJTJRVQLJGXUI2RF4YN2/action/citation_signature","submit_replication":"https://pith.science/pith/3IQ4QKWJTJRVQLJGXUI2RF4YN2/action/replication_record"}},"created_at":"2026-05-18T01:27:16.722078+00:00","updated_at":"2026-05-18T01:27:16.722078+00:00"}