{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7YRNANIJHKTTEBTJA3N3SETLVZ","short_pith_number":"pith:7YRNANIJ","canonical_record":{"source":{"id":"1502.01212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-04T14:46:35Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"e3c4d33ac334be71163db78a607815d49a3d3f054d67fd61614e3e163b3410a1","abstract_canon_sha256":"68c6fc8426cf7000fe48ab6ed6e828e700015df2724eaa235daa4f12e514aeae"},"schema_version":"1.0"},"canonical_sha256":"fe22d035093aa732066906dbb9126bae72847859538908f78cceac61cc79fd59","source":{"kind":"arxiv","id":"1502.01212","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01212","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01212v2","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01212","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"7YRNANIJHKTT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7YRNANIJHKTTEBTJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7YRNANIJ","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7YRNANIJHKTTEBTJA3N3SETLVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-04T14:46:35Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"e3c4d33ac334be71163db78a607815d49a3d3f054d67fd61614e3e163b3410a1","abstract_canon_sha256":"68c6fc8426cf7000fe48ab6ed6e828e700015df2724eaa235daa4f12e514aeae"},"schema_version":"1.0"},"canonical_sha256":"fe22d035093aa732066906dbb9126bae72847859538908f78cceac61cc79fd59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:43.736133Z","signature_b64":"hh3wmBkxrb6DvLOuYubGnKFK8sQR5iW7tFrmYawlibK9/rjqEacWkTOF010V4uPjo1i2tOfdgn9FmKyUSeIfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe22d035093aa732066906dbb9126bae72847859538908f78cceac61cc79fd59","last_reissued_at":"2026-05-18T02:27:43.735635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:43.735635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01212","source_version":2,"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:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LfR86KL6fDRgkEwwm0auS7/BctVhrlv9koMUL+s04CWQh/ULt85E453zoXELSVGUJL9kKqVKp8F2bGFp5I/GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:37:07.926195Z"},"content_sha256":"e01af10462229cd9c1ee11d8711c6b12a432541e539831c5ab0b2dc30d5e923f","schema_version":"1.0","event_id":"sha256:e01af10462229cd9c1ee11d8711c6b12a432541e539831c5ab0b2dc30d5e923f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7YRNANIJHKTTEBTJA3N3SETLVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete metric spaces: structure, enumeration, and $0$-$1$ laws","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Caroline Terry, Dhruv Mubayi","submitted_at":"2015-02-04T14:46:35Z","abstract_excerpt":"Fix an integer $r\\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\\{1,..., r\\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the number of these metric spaces is $\\lceil \\frac{r+1}{2}\\rceil ^{{n\\choose 2} + o(n^2)}$. Related results in the continuous setting have recently been proved by Kozma, Meyerovitch, Peled, and Samotij. When $r$ is even, our structural characterization is more precise, and implies that almost all such metric spaces have all distances at least $r/2$. As an easy c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01212","kind":"arxiv","version":2},"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:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9blfv9VX3Ox4gjlwuyWHWoPw1L3Xh4cvloM93Ll1ABeQ/dIRBLKsLUkXXw67SPoxin+t6ea35HKQnCR0s/vbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:37:07.926554Z"},"content_sha256":"1ebc0d12dcd8a9015e7728308ad264197d1144b97a25c50b0c9ede107c5be3af","schema_version":"1.0","event_id":"sha256:1ebc0d12dcd8a9015e7728308ad264197d1144b97a25c50b0c9ede107c5be3af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YRNANIJHKTTEBTJA3N3SETLVZ/bundle.json","state_url":"https://pith.science/pith/7YRNANIJHKTTEBTJA3N3SETLVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YRNANIJHKTTEBTJA3N3SETLVZ/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-28T16:37:07Z","links":{"resolver":"https://pith.science/pith/7YRNANIJHKTTEBTJA3N3SETLVZ","bundle":"https://pith.science/pith/7YRNANIJHKTTEBTJA3N3SETLVZ/bundle.json","state":"https://pith.science/pith/7YRNANIJHKTTEBTJA3N3SETLVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YRNANIJHKTTEBTJA3N3SETLVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7YRNANIJHKTTEBTJA3N3SETLVZ","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":"68c6fc8426cf7000fe48ab6ed6e828e700015df2724eaa235daa4f12e514aeae","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-04T14:46:35Z","title_canon_sha256":"e3c4d33ac334be71163db78a607815d49a3d3f054d67fd61614e3e163b3410a1"},"schema_version":"1.0","source":{"id":"1502.01212","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01212","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01212v2","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01212","created_at":"2026-05-18T02:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"7YRNANIJHKTT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7YRNANIJHKTTEBTJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7YRNANIJ","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:1ebc0d12dcd8a9015e7728308ad264197d1144b97a25c50b0c9ede107c5be3af","target":"graph","created_at":"2026-05-18T02:27:43Z","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":"Fix an integer $r\\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\\{1,..., r\\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the number of these metric spaces is $\\lceil \\frac{r+1}{2}\\rceil ^{{n\\choose 2} + o(n^2)}$. Related results in the continuous setting have recently been proved by Kozma, Meyerovitch, Peled, and Samotij. When $r$ is even, our structural characterization is more precise, and implies that almost all such metric spaces have all distances at least $r/2$. As an easy c","authors_text":"Caroline Terry, Dhruv Mubayi","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-04T14:46:35Z","title":"Discrete metric spaces: structure, enumeration, and $0$-$1$ laws"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01212","kind":"arxiv","version":2},"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:e01af10462229cd9c1ee11d8711c6b12a432541e539831c5ab0b2dc30d5e923f","target":"record","created_at":"2026-05-18T02:27:43Z","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":"68c6fc8426cf7000fe48ab6ed6e828e700015df2724eaa235daa4f12e514aeae","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-04T14:46:35Z","title_canon_sha256":"e3c4d33ac334be71163db78a607815d49a3d3f054d67fd61614e3e163b3410a1"},"schema_version":"1.0","source":{"id":"1502.01212","kind":"arxiv","version":2}},"canonical_sha256":"fe22d035093aa732066906dbb9126bae72847859538908f78cceac61cc79fd59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe22d035093aa732066906dbb9126bae72847859538908f78cceac61cc79fd59","first_computed_at":"2026-05-18T02:27:43.735635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:43.735635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hh3wmBkxrb6DvLOuYubGnKFK8sQR5iW7tFrmYawlibK9/rjqEacWkTOF010V4uPjo1i2tOfdgn9FmKyUSeIfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:43.736133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01212","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e01af10462229cd9c1ee11d8711c6b12a432541e539831c5ab0b2dc30d5e923f","sha256:1ebc0d12dcd8a9015e7728308ad264197d1144b97a25c50b0c9ede107c5be3af"],"state_sha256":"305c6a05b0aa739ee15c417d5ad41dfe95bd14375cb702546105c64a863c73eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2e6G90j3QzHjbII3RpKDdGvdw+vOuiKsJ62XaVhkmb8deYNFTOFWFUk99poQUMWM7NRL5gL2n/XiTVaZ1Yd/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T16:37:07.928567Z","bundle_sha256":"7a12449ec20f01282cd5e4a8f4609c9f9ffd7ba80ac64a1258fa88d7efaa25f4"}}