{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JZ6ZQLQP2NUHTMLLFX2HVE2SS2","short_pith_number":"pith:JZ6ZQLQP","canonical_record":{"source":{"id":"2312.03919","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2023-12-06T21:34:37Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"6589e8d8e19d37e718bb42aa37032dd72985d8010a91dae30a6153345741e6e4","abstract_canon_sha256":"81c4f39a86023d382e7ed88c62cbb0eb760dd8bd856639cf9974d4a810f36aaf"},"schema_version":"1.0"},"canonical_sha256":"4e7d982e0fd36879b16b2df47a9352969d30d86e2e9a16a2aa61c7f1582d8858","source":{"kind":"arxiv","id":"2312.03919","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.03919","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"2312.03919v8","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03919","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"JZ6ZQLQP2NUH","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"pith_short_16","alias_value":"JZ6ZQLQP2NUHTMLL","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"pith_short_8","alias_value":"JZ6ZQLQP","created_at":"2026-07-05T11:23:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JZ6ZQLQP2NUHTMLLFX2HVE2SS2","target":"record","payload":{"canonical_record":{"source":{"id":"2312.03919","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2023-12-06T21:34:37Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"6589e8d8e19d37e718bb42aa37032dd72985d8010a91dae30a6153345741e6e4","abstract_canon_sha256":"81c4f39a86023d382e7ed88c62cbb0eb760dd8bd856639cf9974d4a810f36aaf"},"schema_version":"1.0"},"canonical_sha256":"4e7d982e0fd36879b16b2df47a9352969d30d86e2e9a16a2aa61c7f1582d8858","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:06.291201Z","signature_b64":"/gRDv5yienEm30QN8DyvorPrTnDhs5fpy/DRDedxroYfX6TVQcEdFLADmem5XVJOgMNBKCFogT+82t5sXeGYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e7d982e0fd36879b16b2df47a9352969d30d86e2e9a16a2aa61c7f1582d8858","last_reissued_at":"2026-07-05T11:23:06.290712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:06.290712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.03919","source_version":8,"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-05T11:23:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvLDxkuggvOS2MtYd4dHKyMLDQM2xu+OGr6D9tk/+OE3tFCxH9TPv/bEfN/N6VVBEcBkGRigS4BshyqAL/LMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:27:07.187334Z"},"content_sha256":"fbee8233abc2efe89af2c67ea3b5146de60535c503d5142107f511ddc7d9306f","schema_version":"1.0","event_id":"sha256:fbee8233abc2efe89af2c67ea3b5146de60535c503d5142107f511ddc7d9306f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JZ6ZQLQP2NUHTMLLFX2HVE2SS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Indivisibility and uniform computational strength","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"math.LO","authors_text":"Kenneth Gill","submitted_at":"2023-12-06T21:34:37Z","abstract_excerpt":"A countable structure is indivisible if for every coloring with finite range there is a monochromatic isomorphic subcopy of the structure. Each indivisible structure naturally corresponds to an indivisibility problem which outputs such a subcopy given a presentation and coloring. We investigate the Weihrauch complexity of the indivisibility problems for two structures: the rational numbers $\\mathbb{Q}$ as a linear order, and the equivalence relation $\\mathscr{E}$ with countably many equivalence classes each having countably many members. We separate the Weihrauch degrees of both corresponding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03919","kind":"arxiv","version":8},"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/2312.03919/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-05T11:23:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPSzLTeVV2KdiG9I7LxGARB7J67mXhC1FtJEzkfXJH9oj9FsVQ3wlv4/vs9b/+0Ev9HlB9rKP3blUOfqRSzKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T20:27:07.187956Z"},"content_sha256":"306cd72e1f66940ad90f80f7fa9833bae9ee6e5bbfe958a41ea04ab82b03b26d","schema_version":"1.0","event_id":"sha256:306cd72e1f66940ad90f80f7fa9833bae9ee6e5bbfe958a41ea04ab82b03b26d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZ6ZQLQP2NUHTMLLFX2HVE2SS2/bundle.json","state_url":"https://pith.science/pith/JZ6ZQLQP2NUHTMLLFX2HVE2SS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZ6ZQLQP2NUHTMLLFX2HVE2SS2/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-13T20:27:07Z","links":{"resolver":"https://pith.science/pith/JZ6ZQLQP2NUHTMLLFX2HVE2SS2","bundle":"https://pith.science/pith/JZ6ZQLQP2NUHTMLLFX2HVE2SS2/bundle.json","state":"https://pith.science/pith/JZ6ZQLQP2NUHTMLLFX2HVE2SS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZ6ZQLQP2NUHTMLLFX2HVE2SS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JZ6ZQLQP2NUHTMLLFX2HVE2SS2","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":"81c4f39a86023d382e7ed88c62cbb0eb760dd8bd856639cf9974d4a810f36aaf","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2023-12-06T21:34:37Z","title_canon_sha256":"6589e8d8e19d37e718bb42aa37032dd72985d8010a91dae30a6153345741e6e4"},"schema_version":"1.0","source":{"id":"2312.03919","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.03919","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"2312.03919v8","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03919","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"JZ6ZQLQP2NUH","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"pith_short_16","alias_value":"JZ6ZQLQP2NUHTMLL","created_at":"2026-07-05T11:23:06Z"},{"alias_kind":"pith_short_8","alias_value":"JZ6ZQLQP","created_at":"2026-07-05T11:23:06Z"}],"graph_snapshots":[{"event_id":"sha256:306cd72e1f66940ad90f80f7fa9833bae9ee6e5bbfe958a41ea04ab82b03b26d","target":"graph","created_at":"2026-07-05T11:23:06Z","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/2312.03919/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A countable structure is indivisible if for every coloring with finite range there is a monochromatic isomorphic subcopy of the structure. Each indivisible structure naturally corresponds to an indivisibility problem which outputs such a subcopy given a presentation and coloring. We investigate the Weihrauch complexity of the indivisibility problems for two structures: the rational numbers $\\mathbb{Q}$ as a linear order, and the equivalence relation $\\mathscr{E}$ with countably many equivalence classes each having countably many members. We separate the Weihrauch degrees of both corresponding ","authors_text":"Kenneth Gill","cross_cats":["cs.LO","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2023-12-06T21:34:37Z","title":"Indivisibility and uniform computational strength"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03919","kind":"arxiv","version":8},"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:fbee8233abc2efe89af2c67ea3b5146de60535c503d5142107f511ddc7d9306f","target":"record","created_at":"2026-07-05T11:23:06Z","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":"81c4f39a86023d382e7ed88c62cbb0eb760dd8bd856639cf9974d4a810f36aaf","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2023-12-06T21:34:37Z","title_canon_sha256":"6589e8d8e19d37e718bb42aa37032dd72985d8010a91dae30a6153345741e6e4"},"schema_version":"1.0","source":{"id":"2312.03919","kind":"arxiv","version":8}},"canonical_sha256":"4e7d982e0fd36879b16b2df47a9352969d30d86e2e9a16a2aa61c7f1582d8858","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e7d982e0fd36879b16b2df47a9352969d30d86e2e9a16a2aa61c7f1582d8858","first_computed_at":"2026-07-05T11:23:06.290712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:06.290712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/gRDv5yienEm30QN8DyvorPrTnDhs5fpy/DRDedxroYfX6TVQcEdFLADmem5XVJOgMNBKCFogT+82t5sXeGYBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:06.291201Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.03919","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbee8233abc2efe89af2c67ea3b5146de60535c503d5142107f511ddc7d9306f","sha256:306cd72e1f66940ad90f80f7fa9833bae9ee6e5bbfe958a41ea04ab82b03b26d"],"state_sha256":"960f2f241e282ba6fa5e23d7448a1c0c6d5499521389b0f575e1fef31e8bfad6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfefSFO3bWARXF5pUEUJYBDzlMpFyu1yrybDx22USKyhRFInSmPqF71WHrMuETcYSisZIw5ZhJxs5q7S305kBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T20:27:07.201328Z","bundle_sha256":"8b35ef598ab6d1f320e96aac7f1d3dc5e9d32d203c343470b990f3b300dc16c9"}}