{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7DR4BPYXL7DF2NPKRRU43PBJVC","short_pith_number":"pith:7DR4BPYX","canonical_record":{"source":{"id":"2604.05304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-07T01:18:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8b5e50e95782cf1b21fa14487318c746e0a9324fefd8a3d343d138c8cd8674be","abstract_canon_sha256":"cacd6ec2f396fa3a997735560d39653bcdb8d6c8a0257e59515860feb1b2beca"},"schema_version":"1.0"},"canonical_sha256":"f8e3c0bf175fc65d35ea8c69cdbc29a8b474deafe990e565d1ca5ae63d476d2a","source":{"kind":"arxiv","id":"2604.05304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.05304","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"arxiv_version","alias_value":"2604.05304v2","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.05304","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_12","alias_value":"7DR4BPYXL7DF","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_16","alias_value":"7DR4BPYXL7DF2NPK","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_8","alias_value":"7DR4BPYX","created_at":"2026-05-26T01:02:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7DR4BPYXL7DF2NPKRRU43PBJVC","target":"record","payload":{"canonical_record":{"source":{"id":"2604.05304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-07T01:18:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8b5e50e95782cf1b21fa14487318c746e0a9324fefd8a3d343d138c8cd8674be","abstract_canon_sha256":"cacd6ec2f396fa3a997735560d39653bcdb8d6c8a0257e59515860feb1b2beca"},"schema_version":"1.0"},"canonical_sha256":"f8e3c0bf175fc65d35ea8c69cdbc29a8b474deafe990e565d1ca5ae63d476d2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:02:34.053270Z","signature_b64":"WvrdVDVOZu1LrJuZUBk0CvQ+98KrNonbGSSU2r5syZyIcErQdiG67Wpj+eHbzFXXIv4QXeXmzzNufdRGX5/sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8e3c0bf175fc65d35ea8c69cdbc29a8b474deafe990e565d1ca5ae63d476d2a","last_reissued_at":"2026-05-26T01:02:34.052167Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:02:34.052167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.05304","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-26T01:02:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHjNqWxlzS4A7f2aIkMF1LqM854DpfshP/Ks1sq/TAikmF8RF7vbEbt150rQnXoggqJVrUggkn8A9G0UXMBFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:45:46.677120Z"},"content_sha256":"9298e1960424712602fe1b74928a92581d4aa0b876cab5591fcd439b8c3abb53","schema_version":"1.0","event_id":"sha256:9298e1960424712602fe1b74928a92581d4aa0b876cab5591fcd439b8c3abb53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7DR4BPYXL7DF2NPKRRU43PBJVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matchable numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A natural number is matchable when its divisors can be bijectively paired with 1 through tau(n) so each pair is coprime, and the paper proves that this property holds for all squarefree numbers while the full set of matchable numbers has a ","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Carl Pomerance, Nathan McNew","submitted_at":"2026-04-07T01:18:01Z","abstract_excerpt":"We say a natural number $n$ is matchable if there is a bijection from the set of $\\tau(n)$ divisors of $n$ to the set $\\{1,2,\\dots,\\tau(n)\\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has an asymptotic density, which we compute, and we show that every squarefree number is matchable. We also present some related unsolved problems."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that the set of matchable numbers has an asymptotic density, which we compute, and we show that every squarefree number is matchable.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The proofs rely on the existence of the required bijection for squarefree numbers and on standard techniques for establishing asymptotic densities of sets defined by divisor conditions; if the combinatorial matching for squarefree n fails in some cases or if the density calculation involves unstated exclusions, the claims would not hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Matchable numbers, defined via a coprime bijection between divisors and {1 to tau(n)}, have a positive asymptotic density that the authors compute, and all squarefree numbers are matchable.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A natural number is matchable when its divisors can be bijectively paired with 1 through tau(n) so each pair is coprime, and the paper proves that this property holds for all squarefree numbers while the full set of matchable numbers has a ","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1444ee55d865664e88ed74935d8859055cc52207d0cc44677fad7963cd54083a"},"source":{"id":"2604.05304","kind":"arxiv","version":2},"verdict":{"id":"69d6b363-9c7d-4eb8-840d-feb0787d349a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T19:28:23.818359Z","strongest_claim":"We show that the set of matchable numbers has an asymptotic density, which we compute, and we show that every squarefree number is matchable.","one_line_summary":"Matchable numbers, defined via a coprime bijection between divisors and {1 to tau(n)}, have a positive asymptotic density that the authors compute, and all squarefree numbers are matchable.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The proofs rely on the existence of the required bijection for squarefree numbers and on standard techniques for establishing asymptotic densities of sets defined by divisor conditions; if the combinatorial matching for squarefree n fails in some cases or if the density calculation involves unstated exclusions, the claims would not hold.","pith_extraction_headline":"A natural number is matchable when its divisors can be bijectively paired with 1 through tau(n) so each pair is coprime, and the paper proves that this property holds for all squarefree numbers while the full set of matchable numbers has a "},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.05304/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":2,"snapshot_sha256":"33726904802b9f0fbff0200fa3461bbb56aeb6e327536e832569d7a61e660c65"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"69d6b363-9c7d-4eb8-840d-feb0787d349a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:02:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A05x0PLRe9o4Kgh2lKJ2VzeKlzzi748H/p6rxizAlQ6Xo25QjIGKDq/NqmXI1WHIvpVvdNQtU5I1yYPs7ZaDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:45:46.677611Z"},"content_sha256":"0bc63a3642114e0473ac845f7dc451cd46fde0bf212382ec872432c1279706e6","schema_version":"1.0","event_id":"sha256:0bc63a3642114e0473ac845f7dc451cd46fde0bf212382ec872432c1279706e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DR4BPYXL7DF2NPKRRU43PBJVC/bundle.json","state_url":"https://pith.science/pith/7DR4BPYXL7DF2NPKRRU43PBJVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DR4BPYXL7DF2NPKRRU43PBJVC/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-02T06:45:46Z","links":{"resolver":"https://pith.science/pith/7DR4BPYXL7DF2NPKRRU43PBJVC","bundle":"https://pith.science/pith/7DR4BPYXL7DF2NPKRRU43PBJVC/bundle.json","state":"https://pith.science/pith/7DR4BPYXL7DF2NPKRRU43PBJVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DR4BPYXL7DF2NPKRRU43PBJVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7DR4BPYXL7DF2NPKRRU43PBJVC","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":"cacd6ec2f396fa3a997735560d39653bcdb8d6c8a0257e59515860feb1b2beca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-07T01:18:01Z","title_canon_sha256":"8b5e50e95782cf1b21fa14487318c746e0a9324fefd8a3d343d138c8cd8674be"},"schema_version":"1.0","source":{"id":"2604.05304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.05304","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"arxiv_version","alias_value":"2604.05304v2","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.05304","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_12","alias_value":"7DR4BPYXL7DF","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_16","alias_value":"7DR4BPYXL7DF2NPK","created_at":"2026-05-26T01:02:34Z"},{"alias_kind":"pith_short_8","alias_value":"7DR4BPYX","created_at":"2026-05-26T01:02:34Z"}],"graph_snapshots":[{"event_id":"sha256:0bc63a3642114e0473ac845f7dc451cd46fde0bf212382ec872432c1279706e6","target":"graph","created_at":"2026-05-26T01:02:34Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that the set of matchable numbers has an asymptotic density, which we compute, and we show that every squarefree number is matchable."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The proofs rely on the existence of the required bijection for squarefree numbers and on standard techniques for establishing asymptotic densities of sets defined by divisor conditions; if the combinatorial matching for squarefree n fails in some cases or if the density calculation involves unstated exclusions, the claims would not hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Matchable numbers, defined via a coprime bijection between divisors and {1 to tau(n)}, have a positive asymptotic density that the authors compute, and all squarefree numbers are matchable."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A natural number is matchable when its divisors can be bijectively paired with 1 through tau(n) so each pair is coprime, and the paper proves that this property holds for all squarefree numbers while the full set of matchable numbers has a "}],"snapshot_sha256":"1444ee55d865664e88ed74935d8859055cc52207d0cc44677fad7963cd54083a"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"33726904802b9f0fbff0200fa3461bbb56aeb6e327536e832569d7a61e660c65"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.05304/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We say a natural number $n$ is matchable if there is a bijection from the set of $\\tau(n)$ divisors of $n$ to the set $\\{1,2,\\dots,\\tau(n)\\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has an asymptotic density, which we compute, and we show that every squarefree number is matchable. We also present some related unsolved problems.","authors_text":"Carl Pomerance, Nathan McNew","cross_cats":["math.CO"],"headline":"A natural number is matchable when its divisors can be bijectively paired with 1 through tau(n) so each pair is coprime, and the paper proves that this property holds for all squarefree numbers while the full set of matchable numbers has a ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-07T01:18:01Z","title":"Matchable numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.05304","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T19:28:23.818359Z","id":"69d6b363-9c7d-4eb8-840d-feb0787d349a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Matchable numbers, defined via a coprime bijection between divisors and {1 to tau(n)}, have a positive asymptotic density that the authors compute, and all squarefree numbers are matchable.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A natural number is matchable when its divisors can be bijectively paired with 1 through tau(n) so each pair is coprime, and the paper proves that this property holds for all squarefree numbers while the full set of matchable numbers has a ","strongest_claim":"We show that the set of matchable numbers has an asymptotic density, which we compute, and we show that every squarefree number is matchable.","weakest_assumption":"The proofs rely on the existence of the required bijection for squarefree numbers and on standard techniques for establishing asymptotic densities of sets defined by divisor conditions; if the combinatorial matching for squarefree n fails in some cases or if the density calculation involves unstated exclusions, the claims would not hold."}},"verdict_id":"69d6b363-9c7d-4eb8-840d-feb0787d349a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9298e1960424712602fe1b74928a92581d4aa0b876cab5591fcd439b8c3abb53","target":"record","created_at":"2026-05-26T01:02:34Z","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":"cacd6ec2f396fa3a997735560d39653bcdb8d6c8a0257e59515860feb1b2beca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-07T01:18:01Z","title_canon_sha256":"8b5e50e95782cf1b21fa14487318c746e0a9324fefd8a3d343d138c8cd8674be"},"schema_version":"1.0","source":{"id":"2604.05304","kind":"arxiv","version":2}},"canonical_sha256":"f8e3c0bf175fc65d35ea8c69cdbc29a8b474deafe990e565d1ca5ae63d476d2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8e3c0bf175fc65d35ea8c69cdbc29a8b474deafe990e565d1ca5ae63d476d2a","first_computed_at":"2026-05-26T01:02:34.052167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:02:34.052167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WvrdVDVOZu1LrJuZUBk0CvQ+98KrNonbGSSU2r5syZyIcErQdiG67Wpj+eHbzFXXIv4QXeXmzzNufdRGX5/sCw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:02:34.053270Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.05304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9298e1960424712602fe1b74928a92581d4aa0b876cab5591fcd439b8c3abb53","sha256:0bc63a3642114e0473ac845f7dc451cd46fde0bf212382ec872432c1279706e6"],"state_sha256":"fee661f69874c63b7be597372cfd94720e1cdd9bee57b023f6874a1edaaf1fc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/182pLrzYkk5HgWnwrukM2Ak4TV4FYMsSs+7A+7mmYSzh4ok59HS33nt/6VUHyzcDrKi20Gd7kkjRYUb1+m/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:45:46.680142Z","bundle_sha256":"895951f1ec07112ad88c221da73beab4b66f53fc1429586142854e3f58371529"}}