{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ACBHFW62BNENKULP5BJXXEKWRX","short_pith_number":"pith:ACBHFW62","canonical_record":{"source":{"id":"2201.06232","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2022-01-17T06:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"38263f23dbe65167722e236dd9c81ab782243618f8aa8fabf738294e80ed3eec","abstract_canon_sha256":"7f8b098ada6cf9b6c4346dfe2a22cccf41714012483827afb427fda43f246c53"},"schema_version":"1.0"},"canonical_sha256":"008272dbda0b48d5516fe8537b91568ddb88c4841c19e63a059830fb6b1c5ca2","source":{"kind":"arxiv","id":"2201.06232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06232","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06232v1","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06232","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_12","alias_value":"ACBHFW62BNEN","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_16","alias_value":"ACBHFW62BNENKULP","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_8","alias_value":"ACBHFW62","created_at":"2026-07-05T03:48:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ACBHFW62BNENKULP5BJXXEKWRX","target":"record","payload":{"canonical_record":{"source":{"id":"2201.06232","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2022-01-17T06:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"38263f23dbe65167722e236dd9c81ab782243618f8aa8fabf738294e80ed3eec","abstract_canon_sha256":"7f8b098ada6cf9b6c4346dfe2a22cccf41714012483827afb427fda43f246c53"},"schema_version":"1.0"},"canonical_sha256":"008272dbda0b48d5516fe8537b91568ddb88c4841c19e63a059830fb6b1c5ca2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:56.128080Z","signature_b64":"p/RdnzobDrLb38l5PzYvTWQ+m3yzwULg7i+K1T90qD0JM2m5VxMCrB9INFloryzo4eE9HYaXxfUNwp2Gn49qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"008272dbda0b48d5516fe8537b91568ddb88c4841c19e63a059830fb6b1c5ca2","last_reissued_at":"2026-07-05T03:48:56.127676Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:56.127676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.06232","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-07-05T03:48:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFFUrppcn/0whqc1lLcRCdWrw/6Yg/EUab9BdPSzejxKV6oHtqeqqIQasBzQjwH8X4MfFb074bDubHqBpTAKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:23:18.774413Z"},"content_sha256":"3dfae97a26e4377622704dafa382a15efc462737cf76eee5a288398165712703","schema_version":"1.0","event_id":"sha256:3dfae97a26e4377622704dafa382a15efc462737cf76eee5a288398165712703"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ACBHFW62BNENKULP5BJXXEKWRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$k$-Diophantine $m$-tuples in Finite Fields","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Arjun Nigam, Dishant Saikia, Kyle Onghai, Lalit M. Sharma, Seoyoung Kim, Steven J. Miller, Trajan Hammonds","submitted_at":"2022-01-17T06:17:15Z","abstract_excerpt":"In this paper, we define a $k$-Diophantine $m$-tuple to be a set of $m$ positive integers such that the product of any $k$ distinct positive integers is one less than a perfect square. We study these sets in finite fields $\\mathbb{F}_p$ for odd prime $p$ and guarantee the existence of a $k$-Diophantine m-tuple provided $p$ is larger than some explicit lower bound. We also give a formula for the number of 3-Diophantine triples in $\\mathbb{F}_p$ as well as an asymptotic formula for the number of $k$-Diophantine $k$-tuples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06232","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.06232/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-05T03:48:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YF9+DBCoAsxOKJCv7my7KOL/kl+NvGvlmtlW0JQnUuAn/FjDuAnVJcOD2VEo6m9ZVOSK/ItKuBJcXW8z9N+6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T16:23:18.774933Z"},"content_sha256":"eb41f27fe2bcccbfb1919045f18766c2c2f6c604309ec76b476be8eb6cbaf6bc","schema_version":"1.0","event_id":"sha256:eb41f27fe2bcccbfb1919045f18766c2c2f6c604309ec76b476be8eb6cbaf6bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACBHFW62BNENKULP5BJXXEKWRX/bundle.json","state_url":"https://pith.science/pith/ACBHFW62BNENKULP5BJXXEKWRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACBHFW62BNENKULP5BJXXEKWRX/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-18T16:23:18Z","links":{"resolver":"https://pith.science/pith/ACBHFW62BNENKULP5BJXXEKWRX","bundle":"https://pith.science/pith/ACBHFW62BNENKULP5BJXXEKWRX/bundle.json","state":"https://pith.science/pith/ACBHFW62BNENKULP5BJXXEKWRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACBHFW62BNENKULP5BJXXEKWRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ACBHFW62BNENKULP5BJXXEKWRX","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":"7f8b098ada6cf9b6c4346dfe2a22cccf41714012483827afb427fda43f246c53","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2022-01-17T06:17:15Z","title_canon_sha256":"38263f23dbe65167722e236dd9c81ab782243618f8aa8fabf738294e80ed3eec"},"schema_version":"1.0","source":{"id":"2201.06232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06232","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06232v1","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06232","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_12","alias_value":"ACBHFW62BNEN","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_16","alias_value":"ACBHFW62BNENKULP","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_8","alias_value":"ACBHFW62","created_at":"2026-07-05T03:48:56Z"}],"graph_snapshots":[{"event_id":"sha256:eb41f27fe2bcccbfb1919045f18766c2c2f6c604309ec76b476be8eb6cbaf6bc","target":"graph","created_at":"2026-07-05T03:48:56Z","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/2201.06232/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we define a $k$-Diophantine $m$-tuple to be a set of $m$ positive integers such that the product of any $k$ distinct positive integers is one less than a perfect square. We study these sets in finite fields $\\mathbb{F}_p$ for odd prime $p$ and guarantee the existence of a $k$-Diophantine m-tuple provided $p$ is larger than some explicit lower bound. We also give a formula for the number of 3-Diophantine triples in $\\mathbb{F}_p$ as well as an asymptotic formula for the number of $k$-Diophantine $k$-tuples.","authors_text":"Arjun Nigam, Dishant Saikia, Kyle Onghai, Lalit M. Sharma, Seoyoung Kim, Steven J. Miller, Trajan Hammonds","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2022-01-17T06:17:15Z","title":"$k$-Diophantine $m$-tuples in Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06232","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:3dfae97a26e4377622704dafa382a15efc462737cf76eee5a288398165712703","target":"record","created_at":"2026-07-05T03:48:56Z","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":"7f8b098ada6cf9b6c4346dfe2a22cccf41714012483827afb427fda43f246c53","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2022-01-17T06:17:15Z","title_canon_sha256":"38263f23dbe65167722e236dd9c81ab782243618f8aa8fabf738294e80ed3eec"},"schema_version":"1.0","source":{"id":"2201.06232","kind":"arxiv","version":1}},"canonical_sha256":"008272dbda0b48d5516fe8537b91568ddb88c4841c19e63a059830fb6b1c5ca2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"008272dbda0b48d5516fe8537b91568ddb88c4841c19e63a059830fb6b1c5ca2","first_computed_at":"2026-07-05T03:48:56.127676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:56.127676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p/RdnzobDrLb38l5PzYvTWQ+m3yzwULg7i+K1T90qD0JM2m5VxMCrB9INFloryzo4eE9HYaXxfUNwp2Gn49qAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:56.128080Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.06232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dfae97a26e4377622704dafa382a15efc462737cf76eee5a288398165712703","sha256:eb41f27fe2bcccbfb1919045f18766c2c2f6c604309ec76b476be8eb6cbaf6bc"],"state_sha256":"2e3210f8152faa4c3addb6e02a540a68d6c90233f737391ddca638716aa70ed6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QM/2r9zWfWJnxI9G94VGW6SxbDbfP/cABnYkvpEw0bOI094apjJn6fT0Inj8Phqlel8MnPAUiGcroagGT8/VDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T16:23:18.778611Z","bundle_sha256":"781cc6154a90292577c58719dd37ee9a452062266b28b0db1ebe8265181cd4fd"}}