{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5YXFGALLTMDHBIFKVZTGJW5UNR","short_pith_number":"pith:5YXFGALL","schema_version":"1.0","canonical_sha256":"ee2e53016b9b0670a0aaae6664dbb46c4a49e1964947aab0ddbb2626923f76e8","source":{"kind":"arxiv","id":"1005.1953","version":2},"attestation_state":"computed","paper":{"title":"A Note On the Bounds for the Generalized Fibonacci-p-Sequence and its Application in Data-Hiding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hameed Al-Qaheri, Sandipan Dey, Sugata Sanyal, Suneeta Sane","submitted_at":"2010-05-11T21:23:42Z","abstract_excerpt":"In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges to a p-degree polynomial and then use this result to prove the bounds for generalized Fibonacci-p sequence, thereby generalizing the exponential bounds for classical Fibonacci Sequence. Then we show how these results can be used to prove efficiency for data hiding techniques using generalized Fibo"},"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":"1005.1953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-11T21:23:42Z","cross_cats_sorted":[],"title_canon_sha256":"3e227f954efaac3efe8872be837ba6c965576d2fb40bec5de449fa9596c8e596","abstract_canon_sha256":"0fa49d44644bdf73c53d9de20455df6ff65200c0e8e54cfc26b430d5e008719a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:58.446324Z","signature_b64":"nTl1sl+9D3Q8oQ2SKspzOy0PSEh2rnGWrK662NGp3Qa8WnvoZdrMzc4Bvc4DGoAT8GLmltBRu4321HX9V0W+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee2e53016b9b0670a0aaae6664dbb46c4a49e1964947aab0ddbb2626923f76e8","last_reissued_at":"2026-05-18T00:56:58.445801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:58.445801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note On the Bounds for the Generalized Fibonacci-p-Sequence and its Application in Data-Hiding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hameed Al-Qaheri, Sandipan Dey, Sugata Sanyal, Suneeta Sane","submitted_at":"2010-05-11T21:23:42Z","abstract_excerpt":"In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges to a p-degree polynomial and then use this result to prove the bounds for generalized Fibonacci-p sequence, thereby generalizing the exponential bounds for classical Fibonacci Sequence. Then we show how these results can be used to prove efficiency for data hiding techniques using generalized Fibo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1953","kind":"arxiv","version":2},"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":"1005.1953","created_at":"2026-05-18T00:56:58.445887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1953v2","created_at":"2026-05-18T00:56:58.445887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1953","created_at":"2026-05-18T00:56:58.445887+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YXFGALLTMDH","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YXFGALLTMDHBIFK","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YXFGALL","created_at":"2026-05-18T12:26:04.259169+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/5YXFGALLTMDHBIFKVZTGJW5UNR","json":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR.json","graph_json":"https://pith.science/api/pith-number/5YXFGALLTMDHBIFKVZTGJW5UNR/graph.json","events_json":"https://pith.science/api/pith-number/5YXFGALLTMDHBIFKVZTGJW5UNR/events.json","paper":"https://pith.science/paper/5YXFGALL"},"agent_actions":{"view_html":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR","download_json":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR.json","view_paper":"https://pith.science/paper/5YXFGALL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1953&json=true","fetch_graph":"https://pith.science/api/pith-number/5YXFGALLTMDHBIFKVZTGJW5UNR/graph.json","fetch_events":"https://pith.science/api/pith-number/5YXFGALLTMDHBIFKVZTGJW5UNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/action/storage_attestation","attest_author":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/action/author_attestation","sign_citation":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/action/citation_signature","submit_replication":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/action/replication_record"}},"created_at":"2026-05-18T00:56:58.445887+00:00","updated_at":"2026-05-18T00:56:58.445887+00:00"}