{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IPHUM2TWL7TTACHY3R5DP6S25A","short_pith_number":"pith:IPHUM2TW","canonical_record":{"source":{"id":"1903.08274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-03-19T22:23:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"af3809d5489a290fa2926e173c1ad98843de86ace7c208b91a2f5df9b4261f01","abstract_canon_sha256":"28dfa25e9ecf7d363009d84ea2439ef74e21ef7724a404a153c738c458a3dec8"},"schema_version":"1.0"},"canonical_sha256":"43cf466a765fe73008f8dc7a37fa5ae8335fb196b5891942c60254e86b9a1d5e","source":{"kind":"arxiv","id":"1903.08274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08274","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08274v1","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08274","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"IPHUM2TWL7TT","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IPHUM2TWL7TTACHY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IPHUM2TW","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IPHUM2TWL7TTACHY3R5DP6S25A","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-03-19T22:23:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"af3809d5489a290fa2926e173c1ad98843de86ace7c208b91a2f5df9b4261f01","abstract_canon_sha256":"28dfa25e9ecf7d363009d84ea2439ef74e21ef7724a404a153c738c458a3dec8"},"schema_version":"1.0"},"canonical_sha256":"43cf466a765fe73008f8dc7a37fa5ae8335fb196b5891942c60254e86b9a1d5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:49.827231Z","signature_b64":"SjvzRqD6awYKJACwc63l9zbEFGwRN2Ovh3h5eUDHm+tvgtcdV3lYQGGuDbXRHkiGyfdQGPdZupSQkmegew3QAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43cf466a765fe73008f8dc7a37fa5ae8335fb196b5891942c60254e86b9a1d5e","last_reissued_at":"2026-05-17T23:50:49.826557Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:49.826557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08274","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-17T23:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMuhITHSZTaigQBzg3fMOoSW5Y2I1+JaKTzcIwvYKDijBIhx3y2kd6yeX0n0x3Pjx55D2HKH2BM9CIpK1lpCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:13:35.381434Z"},"content_sha256":"1d9edd648ae4524781827b3bf633dfa6fcce0889f1d9ac73cf50815cc841dddc","schema_version":"1.0","event_id":"sha256:1d9edd648ae4524781827b3bf633dfa6fcce0889f1d9ac73cf50815cc841dddc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IPHUM2TWL7TTACHY3R5DP6S25A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Slow Fibonacci Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Fan Chung, Ron Graham, Sam Spiro","submitted_at":"2019-03-19T22:23:26Z","abstract_excerpt":"For a positive integer $n$, we study the number of steps to reach $n$ by a {\\it Fibonacci walk} for some starting pair $a_1$ and $a_2$ satisfying the recurrence of $a_{k+2}=a_{k+1}+a_k$. The problem of slow Fibonacci walks, first suggested by Richard Stanley, is to determine the maximum number $s(n)$ of steps for such a Fibonacci walk ending at $n$. Stanley conjectured that for most $n$, there is a slow Fibonacci walk reaching $n = a_s$ with the property that $a_{s+1}$ is the integer closest to $\\phi n$ where $\\phi=(1+\\sqrt{5})/2$. We prove that this is true for only a positive fraction of $n$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08274","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-17T23:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQD/6JK8q3Cf9eSnicFK8shPsXYVz+nxP2Ugj8v0t2SaLoKkyuqDHi7BZzD80qD3s+XVqacm7m1U/mHfjfCOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:13:35.381793Z"},"content_sha256":"3588d3b3a077549feec86d8c4f8208bba4c346f59bfbd8a775f5e27d654ab376","schema_version":"1.0","event_id":"sha256:3588d3b3a077549feec86d8c4f8208bba4c346f59bfbd8a775f5e27d654ab376"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPHUM2TWL7TTACHY3R5DP6S25A/bundle.json","state_url":"https://pith.science/pith/IPHUM2TWL7TTACHY3R5DP6S25A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPHUM2TWL7TTACHY3R5DP6S25A/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-11T12:13:35Z","links":{"resolver":"https://pith.science/pith/IPHUM2TWL7TTACHY3R5DP6S25A","bundle":"https://pith.science/pith/IPHUM2TWL7TTACHY3R5DP6S25A/bundle.json","state":"https://pith.science/pith/IPHUM2TWL7TTACHY3R5DP6S25A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPHUM2TWL7TTACHY3R5DP6S25A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IPHUM2TWL7TTACHY3R5DP6S25A","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":"28dfa25e9ecf7d363009d84ea2439ef74e21ef7724a404a153c738c458a3dec8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-03-19T22:23:26Z","title_canon_sha256":"af3809d5489a290fa2926e173c1ad98843de86ace7c208b91a2f5df9b4261f01"},"schema_version":"1.0","source":{"id":"1903.08274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08274","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08274v1","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08274","created_at":"2026-05-17T23:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"IPHUM2TWL7TT","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IPHUM2TWL7TTACHY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IPHUM2TW","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:3588d3b3a077549feec86d8c4f8208bba4c346f59bfbd8a775f5e27d654ab376","target":"graph","created_at":"2026-05-17T23:50:49Z","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":"For a positive integer $n$, we study the number of steps to reach $n$ by a {\\it Fibonacci walk} for some starting pair $a_1$ and $a_2$ satisfying the recurrence of $a_{k+2}=a_{k+1}+a_k$. The problem of slow Fibonacci walks, first suggested by Richard Stanley, is to determine the maximum number $s(n)$ of steps for such a Fibonacci walk ending at $n$. Stanley conjectured that for most $n$, there is a slow Fibonacci walk reaching $n = a_s$ with the property that $a_{s+1}$ is the integer closest to $\\phi n$ where $\\phi=(1+\\sqrt{5})/2$. We prove that this is true for only a positive fraction of $n$","authors_text":"Fan Chung, Ron Graham, Sam Spiro","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-03-19T22:23:26Z","title":"Slow Fibonacci Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08274","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:1d9edd648ae4524781827b3bf633dfa6fcce0889f1d9ac73cf50815cc841dddc","target":"record","created_at":"2026-05-17T23:50:49Z","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":"28dfa25e9ecf7d363009d84ea2439ef74e21ef7724a404a153c738c458a3dec8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-03-19T22:23:26Z","title_canon_sha256":"af3809d5489a290fa2926e173c1ad98843de86ace7c208b91a2f5df9b4261f01"},"schema_version":"1.0","source":{"id":"1903.08274","kind":"arxiv","version":1}},"canonical_sha256":"43cf466a765fe73008f8dc7a37fa5ae8335fb196b5891942c60254e86b9a1d5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43cf466a765fe73008f8dc7a37fa5ae8335fb196b5891942c60254e86b9a1d5e","first_computed_at":"2026-05-17T23:50:49.826557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:49.826557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SjvzRqD6awYKJACwc63l9zbEFGwRN2Ovh3h5eUDHm+tvgtcdV3lYQGGuDbXRHkiGyfdQGPdZupSQkmegew3QAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:49.827231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d9edd648ae4524781827b3bf633dfa6fcce0889f1d9ac73cf50815cc841dddc","sha256:3588d3b3a077549feec86d8c4f8208bba4c346f59bfbd8a775f5e27d654ab376"],"state_sha256":"04995f7c6370a0876986ded7f49aa7ab926397d65b688e1ba5d3557db67097c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLXjqnbyZG6k15jbb7hn239GIWtvY/DTkqZoFeWashG+mgQSLKssQYSOTJZoC5R5pP6IR7D8mrIT+Rd8r2TDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:13:35.384064Z","bundle_sha256":"d94156f7a231af3f122a144ea45b9bb97ef7e7d23b0fb69453655fcfac922bd1"}}