{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XQRSCI3ZVHNCOIHKLOMOCAG7NZ","short_pith_number":"pith:XQRSCI3Z","canonical_record":{"source":{"id":"1104.1579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-04-08T14:01:41Z","cross_cats_sorted":[],"title_canon_sha256":"1deebd61882a8aba59da1048a81eec3822162ca1a7c29a5d87b0d702553a34f8","abstract_canon_sha256":"0851b84054085430ac66a43b859e6d4cd58c95c1eaf1b1b0aa26bec7939bb3db"},"schema_version":"1.0"},"canonical_sha256":"bc23212379a9da2720ea5b98e100df6e7014fa1e986539d13afeed292c329f74","source":{"kind":"arxiv","id":"1104.1579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1579","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1579v1","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1579","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"XQRSCI3ZVHNC","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XQRSCI3ZVHNCOIHK","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XQRSCI3Z","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XQRSCI3ZVHNCOIHKLOMOCAG7NZ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-04-08T14:01:41Z","cross_cats_sorted":[],"title_canon_sha256":"1deebd61882a8aba59da1048a81eec3822162ca1a7c29a5d87b0d702553a34f8","abstract_canon_sha256":"0851b84054085430ac66a43b859e6d4cd58c95c1eaf1b1b0aa26bec7939bb3db"},"schema_version":"1.0"},"canonical_sha256":"bc23212379a9da2720ea5b98e100df6e7014fa1e986539d13afeed292c329f74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:44.818096Z","signature_b64":"M7ez69QIVEG7Ll8bWqqt4Nj/KWGY58XUV8F5uNYdNn6MopaA61Du8SP8nRGRnks7iVgCL/LuSKzj4QZ2NlMIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc23212379a9da2720ea5b98e100df6e7014fa1e986539d13afeed292c329f74","last_reissued_at":"2026-05-18T04:24:44.817654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:44.817654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1579","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-18T04:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"geTEMTmcNHi1jb9nu3TVVbZunLwWMEEuqWbRdzw+FrKKXnedSElN7IaJoYNHYXbou07p+F5ZCiySij++XVirAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:05:45.306002Z"},"content_sha256":"fe2d52f16e33d52b335844bba14e6c0207f1007e3e5b51c26ee6f48cf533216d","schema_version":"1.0","event_id":"sha256:fe2d52f16e33d52b335844bba14e6c0207f1007e3e5b51c26ee6f48cf533216d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XQRSCI3ZVHNCOIHKLOMOCAG7NZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Cunningham Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Lenny Jones","submitted_at":"2011-04-08T14:01:41Z","abstract_excerpt":"Let $\\epsilon\\in \\{-1,1\\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\\epsilon$ for all $i$, is called a {\\it Cunningham chain} of the first or second kind, depending on whether $\\epsilon =1$ or -1 respectively. If $k$ is the smallest positive integer such that $2p_k+\\epsilon$ is composite, then we say the chain has length $k$. Although such chains are necessarily finite, it is conjectured that for every positive integer $k$, there are infinitely many Cunningham chains of length $k$. A sequence of polynomials $f_1(x), f_2(x), ...$, such that $f_i(x)\\in \\Z[x]$, $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1579","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-18T04:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vot4feANXDtBp9g/3IZycqFCHWGl3NhHsgMGMcIyllTbfTzKJu0t/GxNxNwtQWXkCzMdpMXRyMlMhXeQXGZqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:05:45.306359Z"},"content_sha256":"884bc005d0c6b0ab18e5301882112d19616be759f2f39353f3125f34e557f97e","schema_version":"1.0","event_id":"sha256:884bc005d0c6b0ab18e5301882112d19616be759f2f39353f3125f34e557f97e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQRSCI3ZVHNCOIHKLOMOCAG7NZ/bundle.json","state_url":"https://pith.science/pith/XQRSCI3ZVHNCOIHKLOMOCAG7NZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQRSCI3ZVHNCOIHKLOMOCAG7NZ/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-22T18:05:45Z","links":{"resolver":"https://pith.science/pith/XQRSCI3ZVHNCOIHKLOMOCAG7NZ","bundle":"https://pith.science/pith/XQRSCI3ZVHNCOIHKLOMOCAG7NZ/bundle.json","state":"https://pith.science/pith/XQRSCI3ZVHNCOIHKLOMOCAG7NZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQRSCI3ZVHNCOIHKLOMOCAG7NZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XQRSCI3ZVHNCOIHKLOMOCAG7NZ","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":"0851b84054085430ac66a43b859e6d4cd58c95c1eaf1b1b0aa26bec7939bb3db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-04-08T14:01:41Z","title_canon_sha256":"1deebd61882a8aba59da1048a81eec3822162ca1a7c29a5d87b0d702553a34f8"},"schema_version":"1.0","source":{"id":"1104.1579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1579","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1579v1","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1579","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"XQRSCI3ZVHNC","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XQRSCI3ZVHNCOIHK","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XQRSCI3Z","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:884bc005d0c6b0ab18e5301882112d19616be759f2f39353f3125f34e557f97e","target":"graph","created_at":"2026-05-18T04:24:44Z","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":"Let $\\epsilon\\in \\{-1,1\\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\\epsilon$ for all $i$, is called a {\\it Cunningham chain} of the first or second kind, depending on whether $\\epsilon =1$ or -1 respectively. If $k$ is the smallest positive integer such that $2p_k+\\epsilon$ is composite, then we say the chain has length $k$. Although such chains are necessarily finite, it is conjectured that for every positive integer $k$, there are infinitely many Cunningham chains of length $k$. A sequence of polynomials $f_1(x), f_2(x), ...$, such that $f_i(x)\\in \\Z[x]$, $","authors_text":"Lenny Jones","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-04-08T14:01:41Z","title":"Polynomial Cunningham Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1579","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:fe2d52f16e33d52b335844bba14e6c0207f1007e3e5b51c26ee6f48cf533216d","target":"record","created_at":"2026-05-18T04:24:44Z","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":"0851b84054085430ac66a43b859e6d4cd58c95c1eaf1b1b0aa26bec7939bb3db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-04-08T14:01:41Z","title_canon_sha256":"1deebd61882a8aba59da1048a81eec3822162ca1a7c29a5d87b0d702553a34f8"},"schema_version":"1.0","source":{"id":"1104.1579","kind":"arxiv","version":1}},"canonical_sha256":"bc23212379a9da2720ea5b98e100df6e7014fa1e986539d13afeed292c329f74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc23212379a9da2720ea5b98e100df6e7014fa1e986539d13afeed292c329f74","first_computed_at":"2026-05-18T04:24:44.817654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:44.817654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M7ez69QIVEG7Ll8bWqqt4Nj/KWGY58XUV8F5uNYdNn6MopaA61Du8SP8nRGRnks7iVgCL/LuSKzj4QZ2NlMIAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:44.818096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe2d52f16e33d52b335844bba14e6c0207f1007e3e5b51c26ee6f48cf533216d","sha256:884bc005d0c6b0ab18e5301882112d19616be759f2f39353f3125f34e557f97e"],"state_sha256":"76c47b53d8711a5fbaa92740ce5dd90dd0336e927cc7503033e51c12e32e9d5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"240DcZdZHEtrVa5fjo4Qcgg5nVrXUcZmEZBceksqT7nC0uXXC14iQ9QffCoLPHxBWwWQGmY7hF3TPkz3AHYmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:05:45.308310Z","bundle_sha256":"aa24754f07ba5c99df8a13d8b90433d8f36eb51b5a7ab491bd9a26d4515fd8ea"}}