{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TRWZIOG7YYYCRNAWKINJIUKSM3","short_pith_number":"pith:TRWZIOG7","canonical_record":{"source":{"id":"1907.06350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-15T07:10:41Z","cross_cats_sorted":[],"title_canon_sha256":"3e35c6b7b63f78b57e8f567fa68023da22f43069c4ed04b59b0a633cd86b7c2d","abstract_canon_sha256":"05910963513895097db70019da3f83c5a07042c54a03b7a54bed61a1322945ff"},"schema_version":"1.0"},"canonical_sha256":"9c6d9438dfc63028b416521a94515266da473cc396891d7f26e24ae16e8ce97f","source":{"kind":"arxiv","id":"1907.06350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06350","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06350v1","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06350","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"TRWZIOG7YYYC","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TRWZIOG7YYYCRNAW","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TRWZIOG7","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TRWZIOG7YYYCRNAWKINJIUKSM3","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-15T07:10:41Z","cross_cats_sorted":[],"title_canon_sha256":"3e35c6b7b63f78b57e8f567fa68023da22f43069c4ed04b59b0a633cd86b7c2d","abstract_canon_sha256":"05910963513895097db70019da3f83c5a07042c54a03b7a54bed61a1322945ff"},"schema_version":"1.0"},"canonical_sha256":"9c6d9438dfc63028b416521a94515266da473cc396891d7f26e24ae16e8ce97f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:37.851722Z","signature_b64":"/rPCUS4MzyX4EKKmh8N6g6qIdXUb7yOe3Hkn3LyJR9LzxLcoXndCJiFf2fDveMyoOb92YdfuiDvvvNTj6P+QDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6d9438dfc63028b416521a94515266da473cc396891d7f26e24ae16e8ce97f","last_reissued_at":"2026-05-17T23:40:37.850605Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:37.850605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06350","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:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stQWB7R/tn+cml87X+QPXRdwm8YEI6TWTZX6+R6zg49dHSBdAr3HKDSTsJh4OGLApVzepIVqVQo3gZiDJy/BDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:19:28.087933Z"},"content_sha256":"530b03dbdfe2b4a64a8f80aba6664fcbe701102dab7d2cb0924cb32a589853ff","schema_version":"1.0","event_id":"sha256:530b03dbdfe2b4a64a8f80aba6664fcbe701102dab7d2cb0924cb32a589853ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TRWZIOG7YYYCRNAWKINJIUKSM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constructive Proof of Jacobi's Identity for the Sum of Two Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mario DeFranco","submitted_at":"2019-07-15T07:10:41Z","abstract_excerpt":"We present a constructive proof of Jacobi's identity for the sum of two squares. We present a combinatorial proof of the Jacobi Triple Product and combine with a proof of Hirschhorn to define an algorithm. The input is a factorization $n=dN$ with $d \\equiv1\\mod 4$ plus two bits of data, and whose output is either another factorization $n=d'N'$ and $d' \\equiv3\\mod 4$ with two more bits of data, or a pair of integers whose squares sum to $n$. We phrase this algorithm in terms of integer partitions and matchings on an infinite graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06350","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:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZUTiBlA/+Sd/saV4YYyrzho3xEV6CuuBKxoHiPIkh5rbttYgjeZ55ebdIhXL5sX1egMpyjGuULRoxNGQEXECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:19:28.088266Z"},"content_sha256":"b6e7fa7b1e308f5ba7d837d8d0b70b3f39a57d1ce9d5e731ddd623d1f412cd74","schema_version":"1.0","event_id":"sha256:b6e7fa7b1e308f5ba7d837d8d0b70b3f39a57d1ce9d5e731ddd623d1f412cd74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRWZIOG7YYYCRNAWKINJIUKSM3/bundle.json","state_url":"https://pith.science/pith/TRWZIOG7YYYCRNAWKINJIUKSM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRWZIOG7YYYCRNAWKINJIUKSM3/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-28T12:19:28Z","links":{"resolver":"https://pith.science/pith/TRWZIOG7YYYCRNAWKINJIUKSM3","bundle":"https://pith.science/pith/TRWZIOG7YYYCRNAWKINJIUKSM3/bundle.json","state":"https://pith.science/pith/TRWZIOG7YYYCRNAWKINJIUKSM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRWZIOG7YYYCRNAWKINJIUKSM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TRWZIOG7YYYCRNAWKINJIUKSM3","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":"05910963513895097db70019da3f83c5a07042c54a03b7a54bed61a1322945ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-15T07:10:41Z","title_canon_sha256":"3e35c6b7b63f78b57e8f567fa68023da22f43069c4ed04b59b0a633cd86b7c2d"},"schema_version":"1.0","source":{"id":"1907.06350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06350","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06350v1","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06350","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"TRWZIOG7YYYC","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TRWZIOG7YYYCRNAW","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TRWZIOG7","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:b6e7fa7b1e308f5ba7d837d8d0b70b3f39a57d1ce9d5e731ddd623d1f412cd74","target":"graph","created_at":"2026-05-17T23:40:37Z","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 present a constructive proof of Jacobi's identity for the sum of two squares. We present a combinatorial proof of the Jacobi Triple Product and combine with a proof of Hirschhorn to define an algorithm. The input is a factorization $n=dN$ with $d \\equiv1\\mod 4$ plus two bits of data, and whose output is either another factorization $n=d'N'$ and $d' \\equiv3\\mod 4$ with two more bits of data, or a pair of integers whose squares sum to $n$. We phrase this algorithm in terms of integer partitions and matchings on an infinite graph.","authors_text":"Mario DeFranco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-15T07:10:41Z","title":"A Constructive Proof of Jacobi's Identity for the Sum of Two Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06350","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:530b03dbdfe2b4a64a8f80aba6664fcbe701102dab7d2cb0924cb32a589853ff","target":"record","created_at":"2026-05-17T23:40:37Z","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":"05910963513895097db70019da3f83c5a07042c54a03b7a54bed61a1322945ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-15T07:10:41Z","title_canon_sha256":"3e35c6b7b63f78b57e8f567fa68023da22f43069c4ed04b59b0a633cd86b7c2d"},"schema_version":"1.0","source":{"id":"1907.06350","kind":"arxiv","version":1}},"canonical_sha256":"9c6d9438dfc63028b416521a94515266da473cc396891d7f26e24ae16e8ce97f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c6d9438dfc63028b416521a94515266da473cc396891d7f26e24ae16e8ce97f","first_computed_at":"2026-05-17T23:40:37.850605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:37.850605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/rPCUS4MzyX4EKKmh8N6g6qIdXUb7yOe3Hkn3LyJR9LzxLcoXndCJiFf2fDveMyoOb92YdfuiDvvvNTj6P+QDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:37.851722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:530b03dbdfe2b4a64a8f80aba6664fcbe701102dab7d2cb0924cb32a589853ff","sha256:b6e7fa7b1e308f5ba7d837d8d0b70b3f39a57d1ce9d5e731ddd623d1f412cd74"],"state_sha256":"d8610a32804ac28332a24b8d2cbe438f4b64a707e1d214be42a4c7ec42ab6771"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+6C10RivCIlt0AJbE/zLaGrf6fFkCutkUziJeFE2d8TyBT3CH6rUl20sGadqVoMetVnE3L9ZcQpIy1dK2wECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:19:28.090082Z","bundle_sha256":"c3310747b5aaebeb89401b5628ae0800065505852350b2dffcc29674f8b795af"}}