{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:RBDD4ONIPHQDR353VTVIJUHYM2","short_pith_number":"pith:RBDD4ONI","canonical_record":{"source":{"id":"0901.3075","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2009-01-20T15:37:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"940e049e0c383990d531bb62e728fdb128095aee532902a829731df99abdd512","abstract_canon_sha256":"4c593a5c583333824226a70129633c5da3400c2f99d9a6adb4ec82127b763b21"},"schema_version":"1.0"},"canonical_sha256":"88463e39a879e038efbbacea84d0f8669be625fb3ec1ebd0335217280b0328c6","source":{"kind":"arxiv","id":"0901.3075","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.3075","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"0901.3075v3","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3075","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"RBDD4ONIPHQD","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"pith_short_16","alias_value":"RBDD4ONIPHQDR353","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"pith_short_8","alias_value":"RBDD4ONI","created_at":"2026-07-04T15:36:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:RBDD4ONIPHQDR353VTVIJUHYM2","target":"record","payload":{"canonical_record":{"source":{"id":"0901.3075","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2009-01-20T15:37:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"940e049e0c383990d531bb62e728fdb128095aee532902a829731df99abdd512","abstract_canon_sha256":"4c593a5c583333824226a70129633c5da3400c2f99d9a6adb4ec82127b763b21"},"schema_version":"1.0"},"canonical_sha256":"88463e39a879e038efbbacea84d0f8669be625fb3ec1ebd0335217280b0328c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:36:58.356269Z","signature_b64":"dakBkzdlQlUWnUqfAhDNfJnAJB6XTR3APSWaPjkj6YYQc9UuIHr3YMv1xYiUfzRuw1v6BlNRzN1EcNo0ivdABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88463e39a879e038efbbacea84d0f8669be625fb3ec1ebd0335217280b0328c6","last_reissued_at":"2026-07-04T15:36:58.355842Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:36:58.355842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.3075","source_version":3,"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-07-04T15:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1dCPEkD5a5MXjwr3+sjVNWBTcQ73M80Tpy9hP10iLuX6dE0/Adw/3xLONLgAdHHyHGu2YFeM28urui/4wlaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:28:28.822511Z"},"content_sha256":"9410033cd11caeacda9d7d231d18375ff2df304ef87b609c5d58c6db46472722","schema_version":"1.0","event_id":"sha256:9410033cd11caeacda9d7d231d18375ff2df304ef87b609c5d58c6db46472722"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:RBDD4ONIPHQDR353VTVIJUHYM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixed sums of primes and other terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2009-01-20T15:37:13Z","abstract_excerpt":"In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0, u_1=1 and u_{i+1}=au_i+u_{i-1} for i=1,2,3,..., then all the sums u_m+au_n (m,n=1,2,3,...) are distinct. One of our conjectures states that any integer n>4 can be written as the sum of an odd prime, an odd Fibonacci number and a positive Fibonacci number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3075","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0901.3075/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HXYZF2LtWYblGi4u0GgHp4AuMdEKk2fnsvQcFx07TfWGh3sPs8kiL1xB+ho7TVjbZbnXau9CbBu7YvzIXIXLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:28:28.823081Z"},"content_sha256":"ceb27251940b719637ecd4227ac8e66abdc644362acdcb5cc4a3a5325123f73c","schema_version":"1.0","event_id":"sha256:ceb27251940b719637ecd4227ac8e66abdc644362acdcb5cc4a3a5325123f73c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBDD4ONIPHQDR353VTVIJUHYM2/bundle.json","state_url":"https://pith.science/pith/RBDD4ONIPHQDR353VTVIJUHYM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBDD4ONIPHQDR353VTVIJUHYM2/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-08-04T04:28:28Z","links":{"resolver":"https://pith.science/pith/RBDD4ONIPHQDR353VTVIJUHYM2","bundle":"https://pith.science/pith/RBDD4ONIPHQDR353VTVIJUHYM2/bundle.json","state":"https://pith.science/pith/RBDD4ONIPHQDR353VTVIJUHYM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBDD4ONIPHQDR353VTVIJUHYM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RBDD4ONIPHQDR353VTVIJUHYM2","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":"4c593a5c583333824226a70129633c5da3400c2f99d9a6adb4ec82127b763b21","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2009-01-20T15:37:13Z","title_canon_sha256":"940e049e0c383990d531bb62e728fdb128095aee532902a829731df99abdd512"},"schema_version":"1.0","source":{"id":"0901.3075","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.3075","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"0901.3075v3","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3075","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"RBDD4ONIPHQD","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"pith_short_16","alias_value":"RBDD4ONIPHQDR353","created_at":"2026-07-04T15:36:58Z"},{"alias_kind":"pith_short_8","alias_value":"RBDD4ONI","created_at":"2026-07-04T15:36:58Z"}],"graph_snapshots":[{"event_id":"sha256:ceb27251940b719637ecd4227ac8e66abdc644362acdcb5cc4a3a5325123f73c","target":"graph","created_at":"2026-07-04T15:36: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0901.3075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0, u_1=1 and u_{i+1}=au_i+u_{i-1} for i=1,2,3,..., then all the sums u_m+au_n (m,n=1,2,3,...) are distinct. One of our conjectures states that any integer n>4 can be written as the sum of an odd prime, an odd Fibonacci number and a positive Fibonacci number.","authors_text":"Zhi-Wei Sun","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2009-01-20T15:37:13Z","title":"Mixed sums of primes and other terms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3075","kind":"arxiv","version":3},"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:9410033cd11caeacda9d7d231d18375ff2df304ef87b609c5d58c6db46472722","target":"record","created_at":"2026-07-04T15:36: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":"4c593a5c583333824226a70129633c5da3400c2f99d9a6adb4ec82127b763b21","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2009-01-20T15:37:13Z","title_canon_sha256":"940e049e0c383990d531bb62e728fdb128095aee532902a829731df99abdd512"},"schema_version":"1.0","source":{"id":"0901.3075","kind":"arxiv","version":3}},"canonical_sha256":"88463e39a879e038efbbacea84d0f8669be625fb3ec1ebd0335217280b0328c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88463e39a879e038efbbacea84d0f8669be625fb3ec1ebd0335217280b0328c6","first_computed_at":"2026-07-04T15:36:58.355842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:36:58.355842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dakBkzdlQlUWnUqfAhDNfJnAJB6XTR3APSWaPjkj6YYQc9UuIHr3YMv1xYiUfzRuw1v6BlNRzN1EcNo0ivdABA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:36:58.356269Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.3075","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9410033cd11caeacda9d7d231d18375ff2df304ef87b609c5d58c6db46472722","sha256:ceb27251940b719637ecd4227ac8e66abdc644362acdcb5cc4a3a5325123f73c"],"state_sha256":"d7086e84293f459c6027bdcfc36b3e2d1927b1780cf427d0d52002bb1ff829ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0Z3M+ybY+mnVdKbGqUJCGeDdJpaepfxtg+Tfo9SApUYyYXyL6ByZfw5ncizg0lAk4pFjhcwoI83i7Lb2VztBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T04:28:28.827383Z","bundle_sha256":"4581bd33a0e42ab93c91f3c9d0584f0ee0104963505b8e9d02c9dfde166ff5df"}}