{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:BOPSEG5V6O6OL4ZGKI6NGHFHQB","short_pith_number":"pith:BOPSEG5V","canonical_record":{"source":{"id":"math/0511705","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-11-29T14:21:51Z","cross_cats_sorted":[],"title_canon_sha256":"75bb75369fc710d4f8579890873286ffeedcfe058904dacfc7bef6d644179f13","abstract_canon_sha256":"607b6078cf7c9da8e577d28cb2d3fc80a58987ca10efa1a2a98c284c192eb25d"},"schema_version":"1.0"},"canonical_sha256":"0b9f221bb5f3bce5f326523cd31ca780430249cb4b9f7a1f194c6b6fb6c37f7e","source":{"kind":"arxiv","id":"math/0511705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0511705","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"math/0511705v1","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0511705","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"BOPSEG5V6O6O","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"pith_short_16","alias_value":"BOPSEG5V6O6OL4ZG","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"pith_short_8","alias_value":"BOPSEG5V","created_at":"2026-07-04T14:51:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:BOPSEG5V6O6OL4ZGKI6NGHFHQB","target":"record","payload":{"canonical_record":{"source":{"id":"math/0511705","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-11-29T14:21:51Z","cross_cats_sorted":[],"title_canon_sha256":"75bb75369fc710d4f8579890873286ffeedcfe058904dacfc7bef6d644179f13","abstract_canon_sha256":"607b6078cf7c9da8e577d28cb2d3fc80a58987ca10efa1a2a98c284c192eb25d"},"schema_version":"1.0"},"canonical_sha256":"0b9f221bb5f3bce5f326523cd31ca780430249cb4b9f7a1f194c6b6fb6c37f7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:51:45.472292Z","signature_b64":"NOsC3FFoRksL2oPfE8FMzPNwDXBOsJ1VxL0jWl/t3dPy5TRtlNVUfz3E5k9yx8A2lYaHSXIydzjNLUngF/HPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b9f221bb5f3bce5f326523cd31ca780430249cb4b9f7a1f194c6b6fb6c37f7e","last_reissued_at":"2026-07-04T14:51:45.471875Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:51:45.471875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0511705","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-04T14:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJYmyDVpnc5mUbdhaj/dORIB93ugWAmjk8eqC/g9BAkXaeucaU9szqkuHwMuX8UXVXoyn4E5n+mdiuz3ViVYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:15:20.494901Z"},"content_sha256":"a7b1159a4aca6ff366aba368e3b676bf0e5b4c754e09717a08828932ad39b8ca","schema_version":"1.0","event_id":"sha256:a7b1159a4aca6ff366aba368e3b676bf0e5b4c754e09717a08828932ad39b8ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:BOPSEG5V6O6OL4ZGKI6NGHFHQB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on Erd\\H{o}s-Diophantine graphs and Diophantine carpets","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Axel Kohnert, Sascha Kurz","submitted_at":"2005-11-29T14:21:51Z","abstract_excerpt":"A Diophantine figure is a set of points on the integer grid $\\mathbb{Z}^{2}$ where all mutual Euclidean distances are integers. We also speak of Diophantine graphs. In this language a Diophantine figure is a complete Diophantine graph. Due to a famous theorem of Erd\\H{o}s and Anning there are complete Diophantine graphs which are not contained in larger ones. We call them Erd\\H{o}s-Diophantine graphs. A special class of Diophantine graphs are Diophantine carpets. These are planar triangulations of a subset of the integer grid.\n  We give an effective construction for Erd\\H{o}s-Diophantine graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0511705","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/math/0511705/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-04T14:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JmkF4q6rylDNpNapjZrRTgq3OAAYh1jOhCmdZywiYNglG/KtblQNodf1ZK3vl6louncrxhkux5zVI1fiktSZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:15:20.495516Z"},"content_sha256":"aad173b54458a1e6ff0328d138c01951209475c6cf2e238e3161da2614f15308","schema_version":"1.0","event_id":"sha256:aad173b54458a1e6ff0328d138c01951209475c6cf2e238e3161da2614f15308"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOPSEG5V6O6OL4ZGKI6NGHFHQB/bundle.json","state_url":"https://pith.science/pith/BOPSEG5V6O6OL4ZGKI6NGHFHQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOPSEG5V6O6OL4ZGKI6NGHFHQB/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-11T09:15:20Z","links":{"resolver":"https://pith.science/pith/BOPSEG5V6O6OL4ZGKI6NGHFHQB","bundle":"https://pith.science/pith/BOPSEG5V6O6OL4ZGKI6NGHFHQB/bundle.json","state":"https://pith.science/pith/BOPSEG5V6O6OL4ZGKI6NGHFHQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOPSEG5V6O6OL4ZGKI6NGHFHQB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:BOPSEG5V6O6OL4ZGKI6NGHFHQB","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":"607b6078cf7c9da8e577d28cb2d3fc80a58987ca10efa1a2a98c284c192eb25d","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2005-11-29T14:21:51Z","title_canon_sha256":"75bb75369fc710d4f8579890873286ffeedcfe058904dacfc7bef6d644179f13"},"schema_version":"1.0","source":{"id":"math/0511705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0511705","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"math/0511705v1","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0511705","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"BOPSEG5V6O6O","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"pith_short_16","alias_value":"BOPSEG5V6O6OL4ZG","created_at":"2026-07-04T14:51:45Z"},{"alias_kind":"pith_short_8","alias_value":"BOPSEG5V","created_at":"2026-07-04T14:51:45Z"}],"graph_snapshots":[{"event_id":"sha256:aad173b54458a1e6ff0328d138c01951209475c6cf2e238e3161da2614f15308","target":"graph","created_at":"2026-07-04T14:51:45Z","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/math/0511705/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A Diophantine figure is a set of points on the integer grid $\\mathbb{Z}^{2}$ where all mutual Euclidean distances are integers. We also speak of Diophantine graphs. In this language a Diophantine figure is a complete Diophantine graph. Due to a famous theorem of Erd\\H{o}s and Anning there are complete Diophantine graphs which are not contained in larger ones. We call them Erd\\H{o}s-Diophantine graphs. A special class of Diophantine graphs are Diophantine carpets. These are planar triangulations of a subset of the integer grid.\n  We give an effective construction for Erd\\H{o}s-Diophantine graph","authors_text":"Axel Kohnert, Sascha Kurz","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2005-11-29T14:21:51Z","title":"A note on Erd\\H{o}s-Diophantine graphs and Diophantine carpets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0511705","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:a7b1159a4aca6ff366aba368e3b676bf0e5b4c754e09717a08828932ad39b8ca","target":"record","created_at":"2026-07-04T14:51:45Z","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":"607b6078cf7c9da8e577d28cb2d3fc80a58987ca10efa1a2a98c284c192eb25d","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2005-11-29T14:21:51Z","title_canon_sha256":"75bb75369fc710d4f8579890873286ffeedcfe058904dacfc7bef6d644179f13"},"schema_version":"1.0","source":{"id":"math/0511705","kind":"arxiv","version":1}},"canonical_sha256":"0b9f221bb5f3bce5f326523cd31ca780430249cb4b9f7a1f194c6b6fb6c37f7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b9f221bb5f3bce5f326523cd31ca780430249cb4b9f7a1f194c6b6fb6c37f7e","first_computed_at":"2026-07-04T14:51:45.471875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:51:45.471875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NOsC3FFoRksL2oPfE8FMzPNwDXBOsJ1VxL0jWl/t3dPy5TRtlNVUfz3E5k9yx8A2lYaHSXIydzjNLUngF/HPCw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:51:45.472292Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0511705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7b1159a4aca6ff366aba368e3b676bf0e5b4c754e09717a08828932ad39b8ca","sha256:aad173b54458a1e6ff0328d138c01951209475c6cf2e238e3161da2614f15308"],"state_sha256":"ddb74b6541d1701984529dbc4589583d652b748717d9df147dfd5e2b19636d3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfMrN4vsPsDI/UEG0F7dXT2/F/ArIA7McrkNBHX2UQUYz0XXdTcc2ABag/x+lO07ak2lbxvCXY/VWwR3R6dAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T09:15:20.500899Z","bundle_sha256":"611c3b7ed959f8985a97e6ca6709d4b98e578540bd21cb4671c16e51f24fd39c"}}