{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PHQO32DV4IABK65DGWLIYU5RU2","short_pith_number":"pith:PHQO32DV","canonical_record":{"source":{"id":"1602.07225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T16:25:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4abc9d30dce8af8842408a33d9f98b0017ec27322f9a4eb70af6aaf69ab7e211","abstract_canon_sha256":"5e408e16099c0477782721d4641b8c2df7e48b505f720ee7807b734783100d94"},"schema_version":"1.0"},"canonical_sha256":"79e0ede875e200157ba335968c53b1a6b0f29967ffcfe98e7d125a6c164293e9","source":{"kind":"arxiv","id":"1602.07225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07225","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07225v1","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07225","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"PHQO32DV4IAB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHQO32DV4IABK65D","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHQO32DV","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PHQO32DV4IABK65DGWLIYU5RU2","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T16:25:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4abc9d30dce8af8842408a33d9f98b0017ec27322f9a4eb70af6aaf69ab7e211","abstract_canon_sha256":"5e408e16099c0477782721d4641b8c2df7e48b505f720ee7807b734783100d94"},"schema_version":"1.0"},"canonical_sha256":"79e0ede875e200157ba335968c53b1a6b0f29967ffcfe98e7d125a6c164293e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:06.910592Z","signature_b64":"Z5pw8F1tDjnUUSGR4/I96zIufDh1JxP+gexWikLnrI1ZmgBfO36dW7uT7IFd3KGNhXKZAjWELuO772H5YibbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e0ede875e200157ba335968c53b1a6b0f29967ffcfe98e7d125a6c164293e9","last_reissued_at":"2026-05-18T01:20:06.910002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:06.910002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07225","source_version":1,"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-18T01:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufSvjBQ5IMvrOJJo5rO26jyj739XWGTt74dJwUuiWy64qj6d73tRDfEfuNiNZnb+dQ59Ecxm2FvPFUPGfB1MAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:02:47.275396Z"},"content_sha256":"f97d2114d518eb865664e35fa93994a7b3b50767ea2787d0be39d06f6c9465f7","schema_version":"1.0","event_id":"sha256:f97d2114d518eb865664e35fa93994a7b3b50767ea2787d0be39d06f6c9465f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PHQO32DV4IABK65DGWLIYU5RU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strictly Positive and Continuous Random Fibonacci Sequences and Network Theory Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Simmons, Justin Coon","submitted_at":"2016-02-23T16:25:22Z","abstract_excerpt":"We motivate the study of a certain class of random Fibonacci sequences - which we call continuous random Fibonacci sequences - by demonstrating that their exponential growth rate can be used to establish capacity and power scaling laws for multihop cooperative amplify-and-forward (AF) relay networks. With these laws, we show that it is possible to construct multihop cooperative AF networks that simultaneously avoid 1) exponential capacity decay and 2) exponential transmit power growth across the network. This is achieved by ensuring the network's Lyapunov exponent is zero."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07225","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"},"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-18T01:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8khm4z4R27+yHiJBZkE/WQam3awM1uuOxJM/0xARqGWJLbuzfPToccHhkfIapp23c/k53nQLuYMoGRpGOXmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:02:47.275773Z"},"content_sha256":"4bfe661f4986ee331edf85f215f07157c74479a3e6260baac5af7645eb11a911","schema_version":"1.0","event_id":"sha256:4bfe661f4986ee331edf85f215f07157c74479a3e6260baac5af7645eb11a911"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHQO32DV4IABK65DGWLIYU5RU2/bundle.json","state_url":"https://pith.science/pith/PHQO32DV4IABK65DGWLIYU5RU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHQO32DV4IABK65DGWLIYU5RU2/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-06-24T23:02:47Z","links":{"resolver":"https://pith.science/pith/PHQO32DV4IABK65DGWLIYU5RU2","bundle":"https://pith.science/pith/PHQO32DV4IABK65DGWLIYU5RU2/bundle.json","state":"https://pith.science/pith/PHQO32DV4IABK65DGWLIYU5RU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHQO32DV4IABK65DGWLIYU5RU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PHQO32DV4IABK65DGWLIYU5RU2","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":"5e408e16099c0477782721d4641b8c2df7e48b505f720ee7807b734783100d94","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T16:25:22Z","title_canon_sha256":"4abc9d30dce8af8842408a33d9f98b0017ec27322f9a4eb70af6aaf69ab7e211"},"schema_version":"1.0","source":{"id":"1602.07225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07225","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07225v1","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07225","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"PHQO32DV4IAB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHQO32DV4IABK65D","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHQO32DV","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:4bfe661f4986ee331edf85f215f07157c74479a3e6260baac5af7645eb11a911","target":"graph","created_at":"2026-05-18T01:20:06Z","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":"We motivate the study of a certain class of random Fibonacci sequences - which we call continuous random Fibonacci sequences - by demonstrating that their exponential growth rate can be used to establish capacity and power scaling laws for multihop cooperative amplify-and-forward (AF) relay networks. With these laws, we show that it is possible to construct multihop cooperative AF networks that simultaneously avoid 1) exponential capacity decay and 2) exponential transmit power growth across the network. This is achieved by ensuring the network's Lyapunov exponent is zero.","authors_text":"David Simmons, Justin Coon","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T16:25:22Z","title":"Strictly Positive and Continuous Random Fibonacci Sequences and Network Theory Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07225","kind":"arxiv","version":1},"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:f97d2114d518eb865664e35fa93994a7b3b50767ea2787d0be39d06f6c9465f7","target":"record","created_at":"2026-05-18T01:20:06Z","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":"5e408e16099c0477782721d4641b8c2df7e48b505f720ee7807b734783100d94","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T16:25:22Z","title_canon_sha256":"4abc9d30dce8af8842408a33d9f98b0017ec27322f9a4eb70af6aaf69ab7e211"},"schema_version":"1.0","source":{"id":"1602.07225","kind":"arxiv","version":1}},"canonical_sha256":"79e0ede875e200157ba335968c53b1a6b0f29967ffcfe98e7d125a6c164293e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79e0ede875e200157ba335968c53b1a6b0f29967ffcfe98e7d125a6c164293e9","first_computed_at":"2026-05-18T01:20:06.910002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:06.910002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z5pw8F1tDjnUUSGR4/I96zIufDh1JxP+gexWikLnrI1ZmgBfO36dW7uT7IFd3KGNhXKZAjWELuO772H5YibbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:06.910592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f97d2114d518eb865664e35fa93994a7b3b50767ea2787d0be39d06f6c9465f7","sha256:4bfe661f4986ee331edf85f215f07157c74479a3e6260baac5af7645eb11a911"],"state_sha256":"ddd51c6db684ff8f17b946373fbb8c1cad51a0fb43a5b2b88bc58cd33a69b77a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lqa6LYvJHV/rctJEqCqiARDwJ225cScmUB6hR1DUaHLHJAJcIisK/cQAipGPO9gmKzBK/OgfXZe9piH72M4UDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:02:47.277775Z","bundle_sha256":"b7319026fbec2a9b590bfdbfd908cce097247cf4d4be1e70e2b7cbba31e5d3f5"}}