{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5YXFGALLTMDHBIFKVZTGJW5UNR","short_pith_number":"pith:5YXFGALL","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"},"canonical_sha256":"ee2e53016b9b0670a0aaae6664dbb46c4a49e1964947aab0ddbb2626923f76e8","source":{"kind":"arxiv","id":"1005.1953","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1953","created_at":"2026-05-18T00:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1953v2","created_at":"2026-05-18T00:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1953","created_at":"2026-05-18T00:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"5YXFGALLTMDH","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5YXFGALLTMDHBIFK","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5YXFGALL","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5YXFGALLTMDHBIFKVZTGJW5UNR","target":"record","payload":{"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"},"canonical_sha256":"ee2e53016b9b0670a0aaae6664dbb46c4a49e1964947aab0ddbb2626923f76e8","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"},"source_kind":"arxiv","source_id":"1005.1953","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dInt+mjq2H+uY/xX2C25vvUt22IHs5yB5UytXw/eIa1tMNeiJWgNa59W+rcWf2v6X/x/K1UH2gpxE2pi6/ueDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:59:59.976835Z"},"content_sha256":"7ccf0b8667d57d5be0748eaa766bf505a70cd30ee43b1d92f34992a07a2db90b","schema_version":"1.0","event_id":"sha256:7ccf0b8667d57d5be0748eaa766bf505a70cd30ee43b1d92f34992a07a2db90b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5YXFGALLTMDHBIFKVZTGJW5UNR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ub/ZIDm0fkyKt0ca4NZ14QxOlg5mnMCOa6WVz7iiKp3UBv3X5JCO+fS5YS91F+LuTmgt2siPji6gXH9Xejz6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:59:59.977175Z"},"content_sha256":"2839f882b2058e1a17097e170d23edc91114ca1f13e36909376503e281f6261e","schema_version":"1.0","event_id":"sha256:2839f882b2058e1a17097e170d23edc91114ca1f13e36909376503e281f6261e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/bundle.json","state_url":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T06:59:59Z","links":{"resolver":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR","bundle":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/bundle.json","state":"https://pith.science/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YXFGALLTMDHBIFKVZTGJW5UNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5YXFGALLTMDHBIFKVZTGJW5UNR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0fa49d44644bdf73c53d9de20455df6ff65200c0e8e54cfc26b430d5e008719a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-11T21:23:42Z","title_canon_sha256":"3e227f954efaac3efe8872be837ba6c965576d2fb40bec5de449fa9596c8e596"},"schema_version":"1.0","source":{"id":"1005.1953","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1953","created_at":"2026-05-18T00:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1953v2","created_at":"2026-05-18T00:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1953","created_at":"2026-05-18T00:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"5YXFGALLTMDH","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5YXFGALLTMDHBIFK","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5YXFGALL","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:2839f882b2058e1a17097e170d23edc91114ca1f13e36909376503e281f6261e","target":"graph","created_at":"2026-05-18T00:56:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hameed Al-Qaheri, Sandipan Dey, Sugata Sanyal, Suneeta Sane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-11T21:23:42Z","title":"A Note On the Bounds for the Generalized Fibonacci-p-Sequence and its Application in Data-Hiding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1953","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7ccf0b8667d57d5be0748eaa766bf505a70cd30ee43b1d92f34992a07a2db90b","target":"record","created_at":"2026-05-18T00:56:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0fa49d44644bdf73c53d9de20455df6ff65200c0e8e54cfc26b430d5e008719a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-05-11T21:23:42Z","title_canon_sha256":"3e227f954efaac3efe8872be837ba6c965576d2fb40bec5de449fa9596c8e596"},"schema_version":"1.0","source":{"id":"1005.1953","kind":"arxiv","version":2}},"canonical_sha256":"ee2e53016b9b0670a0aaae6664dbb46c4a49e1964947aab0ddbb2626923f76e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee2e53016b9b0670a0aaae6664dbb46c4a49e1964947aab0ddbb2626923f76e8","first_computed_at":"2026-05-18T00:56:58.445801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:58.445801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nTl1sl+9D3Q8oQ2SKspzOy0PSEh2rnGWrK662NGp3Qa8WnvoZdrMzc4Bvc4DGoAT8GLmltBRu4321HX9V0W+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:58.446324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.1953","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ccf0b8667d57d5be0748eaa766bf505a70cd30ee43b1d92f34992a07a2db90b","sha256:2839f882b2058e1a17097e170d23edc91114ca1f13e36909376503e281f6261e"],"state_sha256":"56422d2368cb4050ba4e12987684e8b379afaee7011628b729b6d7d10bdc2d3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9QWYGDH4y5f9dlOZt8u9o7/asWERUpqKBF1Q6q2NO7etxBYdI85wZ8Z5cZIymiUZOYHsbY1b7H7+0gqmyO0NCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:59:59.979281Z","bundle_sha256":"10edeb93dc43e8aae6dc8efcb443fdd0ac55a9c04ff00235da0087bdb7eb280c"}}