{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CFQ6WXG5WM4XMEJYA2T7LK2B6B","short_pith_number":"pith:CFQ6WXG5","canonical_record":{"source":{"id":"1404.3494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-14T08:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"a749402f0340651c93cc845cccf7ea8a2a373360a24741dd5df12a355b4fa748","abstract_canon_sha256":"5d404092e94394f1b83f9ac1dc72ca787486292d5e2bf2854ae4d56f289c6654"},"schema_version":"1.0"},"canonical_sha256":"1161eb5cddb33976113806a7f5ab41f050cb8ac71be30ac0bb4d845c7da8f45c","source":{"kind":"arxiv","id":"1404.3494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3494","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3494v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3494","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"CFQ6WXG5WM4X","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CFQ6WXG5WM4XMEJY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CFQ6WXG5","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CFQ6WXG5WM4XMEJYA2T7LK2B6B","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-14T08:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"a749402f0340651c93cc845cccf7ea8a2a373360a24741dd5df12a355b4fa748","abstract_canon_sha256":"5d404092e94394f1b83f9ac1dc72ca787486292d5e2bf2854ae4d56f289c6654"},"schema_version":"1.0"},"canonical_sha256":"1161eb5cddb33976113806a7f5ab41f050cb8ac71be30ac0bb4d845c7da8f45c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:15.100533Z","signature_b64":"UgH1olOyydkBJsJAxzk3G6KiGxkdbYFSlqg84sCFfjmV0jueRJYQ8QBJfa2X4BzgdgwO1EtrLWwYwVyhqPsxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1161eb5cddb33976113806a7f5ab41f050cb8ac71be30ac0bb4d845c7da8f45c","last_reissued_at":"2026-05-18T02:54:15.100103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:15.100103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3494","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-18T02:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9tI1ueTfeKeD1wDquKE23ApLZZu3LdsoINgYsHiHFe8lZ6fZF6MEIUfwzC4RQc8aMDBUeQ2rKnJ80NNQJ+B/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:23:26.665147Z"},"content_sha256":"1b5abf66afe458ff64b302587082adef588b295f629556c3b0bcf34d12cfb571","schema_version":"1.0","event_id":"sha256:1b5abf66afe458ff64b302587082adef588b295f629556c3b0bcf34d12cfb571"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CFQ6WXG5WM4XMEJYA2T7LK2B6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial-Value Sieving and Recursively-Factorable Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jonathan Burns","submitted_at":"2014-04-14T08:55:07Z","abstract_excerpt":"We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial values into two parts are here called recursively-factorable polynomials. In particular, we prove that $n^2+1$ and the prime-producing polynomials $n^2+n+41$ and $2n^2+ 29$ are recursively-factorable.\n  For quadratics, the we prove that this recursive structure is equivalent to a Diophantine identity involving the product of two binary quadratic forms. We sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3494","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-18T02:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQ4HSKj/j9BJVSK4i4j5hlWJf4s/8BZLjdfzYu19r6XmyIIqFOoWg+r66IOGhb9Do2CNwLPCQDVVEqnfNiUjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:23:26.665508Z"},"content_sha256":"f83a0e09c1eacc4964b0214b04767e5aa9255799fdaaad1de25fa67e0320e3dd","schema_version":"1.0","event_id":"sha256:f83a0e09c1eacc4964b0214b04767e5aa9255799fdaaad1de25fa67e0320e3dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFQ6WXG5WM4XMEJYA2T7LK2B6B/bundle.json","state_url":"https://pith.science/pith/CFQ6WXG5WM4XMEJYA2T7LK2B6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFQ6WXG5WM4XMEJYA2T7LK2B6B/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-24T13:23:26Z","links":{"resolver":"https://pith.science/pith/CFQ6WXG5WM4XMEJYA2T7LK2B6B","bundle":"https://pith.science/pith/CFQ6WXG5WM4XMEJYA2T7LK2B6B/bundle.json","state":"https://pith.science/pith/CFQ6WXG5WM4XMEJYA2T7LK2B6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFQ6WXG5WM4XMEJYA2T7LK2B6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CFQ6WXG5WM4XMEJYA2T7LK2B6B","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":"5d404092e94394f1b83f9ac1dc72ca787486292d5e2bf2854ae4d56f289c6654","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-14T08:55:07Z","title_canon_sha256":"a749402f0340651c93cc845cccf7ea8a2a373360a24741dd5df12a355b4fa748"},"schema_version":"1.0","source":{"id":"1404.3494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3494","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3494v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3494","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"CFQ6WXG5WM4X","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CFQ6WXG5WM4XMEJY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CFQ6WXG5","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:f83a0e09c1eacc4964b0214b04767e5aa9255799fdaaad1de25fa67e0320e3dd","target":"graph","created_at":"2026-05-18T02:54:15Z","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 identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial values into two parts are here called recursively-factorable polynomials. In particular, we prove that $n^2+1$ and the prime-producing polynomials $n^2+n+41$ and $2n^2+ 29$ are recursively-factorable.\n  For quadratics, the we prove that this recursive structure is equivalent to a Diophantine identity involving the product of two binary quadratic forms. We sho","authors_text":"Jonathan Burns","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-14T08:55:07Z","title":"Polynomial-Value Sieving and Recursively-Factorable Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3494","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:1b5abf66afe458ff64b302587082adef588b295f629556c3b0bcf34d12cfb571","target":"record","created_at":"2026-05-18T02:54:15Z","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":"5d404092e94394f1b83f9ac1dc72ca787486292d5e2bf2854ae4d56f289c6654","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-14T08:55:07Z","title_canon_sha256":"a749402f0340651c93cc845cccf7ea8a2a373360a24741dd5df12a355b4fa748"},"schema_version":"1.0","source":{"id":"1404.3494","kind":"arxiv","version":1}},"canonical_sha256":"1161eb5cddb33976113806a7f5ab41f050cb8ac71be30ac0bb4d845c7da8f45c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1161eb5cddb33976113806a7f5ab41f050cb8ac71be30ac0bb4d845c7da8f45c","first_computed_at":"2026-05-18T02:54:15.100103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:15.100103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UgH1olOyydkBJsJAxzk3G6KiGxkdbYFSlqg84sCFfjmV0jueRJYQ8QBJfa2X4BzgdgwO1EtrLWwYwVyhqPsxBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:15.100533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b5abf66afe458ff64b302587082adef588b295f629556c3b0bcf34d12cfb571","sha256:f83a0e09c1eacc4964b0214b04767e5aa9255799fdaaad1de25fa67e0320e3dd"],"state_sha256":"7aff087ff4510dbcac91ef7b4ae84496c6df3cdb8d38a3428646196e8400fbc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iaU6VpzKn2mEgBdsH8wxYVzqoPn4Z6u8FT8IXZnru6CAxkhVHjYx8AHx2z0VSXgWUqs6gBb+oIu8xSEwFES3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:23:26.667479Z","bundle_sha256":"3965fe28cca01ef82802d19f5b298e4219a218572a57db66b842aa98e909ff34"}}