{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VNUPGX3IB24NLKRBGZWVDZCQXP","short_pith_number":"pith:VNUPGX3I","canonical_record":{"source":{"id":"2601.04256","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-01-06T22:32:14Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"cb013c8a3c6befa5aac8644cf73e0e963e99052c446dd9b51646f25d47a2bef2","abstract_canon_sha256":"80a09af772199c6a13b30c2784fe874a5f75afba9ac321e9f26e6d058fa340e2"},"schema_version":"1.0"},"canonical_sha256":"ab68f35f680eb8d5aa21366d51e450bbe53279382a519f4e5e22acdd698363d9","source":{"kind":"arxiv","id":"2601.04256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.04256","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"2601.04256v2","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.04256","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"VNUPGX3IB24N","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"pith_short_16","alias_value":"VNUPGX3IB24NLKRB","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"pith_short_8","alias_value":"VNUPGX3I","created_at":"2026-06-19T16:11:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VNUPGX3IB24NLKRBGZWVDZCQXP","target":"record","payload":{"canonical_record":{"source":{"id":"2601.04256","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-01-06T22:32:14Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"cb013c8a3c6befa5aac8644cf73e0e963e99052c446dd9b51646f25d47a2bef2","abstract_canon_sha256":"80a09af772199c6a13b30c2784fe874a5f75afba9ac321e9f26e6d058fa340e2"},"schema_version":"1.0"},"canonical_sha256":"ab68f35f680eb8d5aa21366d51e450bbe53279382a519f4e5e22acdd698363d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:19.081524Z","signature_b64":"2JWNVPxPb6Z+I4QiXpmJPcyTVEXX0fEghzjzQ9mFOXdSdm543ISdVy0i6NLB0X9ZIJPpCXNfGOYK1M6oYsl8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab68f35f680eb8d5aa21366d51e450bbe53279382a519f4e5e22acdd698363d9","last_reissued_at":"2026-06-19T16:11:19.081134Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:19.081134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.04256","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-06-19T16:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkSux9DZgiTWy8/gfi4OaqZKavSC6x3obctkkPOC1BYyzpdtp+yxalP6rbz37larfhNIcmB6oueIvEAeSZnLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:41:29.373782Z"},"content_sha256":"f90b1254f28c8b192bc68b12d975280d92b3c2b4cee0c78799a1ff948f898a97","schema_version":"1.0","event_id":"sha256:f90b1254f28c8b192bc68b12d975280d92b3c2b4cee0c78799a1ff948f898a97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VNUPGX3IB24NLKRBGZWVDZCQXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of being monitorable","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Francesco Dagnino, Riccardo Camerlo","submitted_at":"2026-01-06T22:32:14Z","abstract_excerpt":"We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the family of monitorable sets is $\\Pi^0_3$ and determine the exact complexities it can have. In contrast, we show that if $X$ is not second countable then the family of monitorable sets can be much more complex, giving an example where it is $ \\Pi^1_1$-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.04256","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.04256/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-06-19T16:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOoVy75SitJT3tfsi2NS6wKFtzDyaS57Jv/LiMw21ipy/SlRkd96qJejztKAp3OYimTt99ClbfyMFacqoY6nAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:41:29.374170Z"},"content_sha256":"d9971f077188217abec9f4f5958e15e08c80f8fbc97286c328de0a788c3c1782","schema_version":"1.0","event_id":"sha256:d9971f077188217abec9f4f5958e15e08c80f8fbc97286c328de0a788c3c1782"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNUPGX3IB24NLKRBGZWVDZCQXP/bundle.json","state_url":"https://pith.science/pith/VNUPGX3IB24NLKRBGZWVDZCQXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNUPGX3IB24NLKRBGZWVDZCQXP/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-21T10:41:29Z","links":{"resolver":"https://pith.science/pith/VNUPGX3IB24NLKRBGZWVDZCQXP","bundle":"https://pith.science/pith/VNUPGX3IB24NLKRBGZWVDZCQXP/bundle.json","state":"https://pith.science/pith/VNUPGX3IB24NLKRBGZWVDZCQXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNUPGX3IB24NLKRBGZWVDZCQXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VNUPGX3IB24NLKRBGZWVDZCQXP","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":"80a09af772199c6a13b30c2784fe874a5f75afba9ac321e9f26e6d058fa340e2","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-01-06T22:32:14Z","title_canon_sha256":"cb013c8a3c6befa5aac8644cf73e0e963e99052c446dd9b51646f25d47a2bef2"},"schema_version":"1.0","source":{"id":"2601.04256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.04256","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"2601.04256v2","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.04256","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"VNUPGX3IB24N","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"pith_short_16","alias_value":"VNUPGX3IB24NLKRB","created_at":"2026-06-19T16:11:19Z"},{"alias_kind":"pith_short_8","alias_value":"VNUPGX3I","created_at":"2026-06-19T16:11:19Z"}],"graph_snapshots":[{"event_id":"sha256:d9971f077188217abec9f4f5958e15e08c80f8fbc97286c328de0a788c3c1782","target":"graph","created_at":"2026-06-19T16:11:19Z","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/2601.04256/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the family of monitorable sets is $\\Pi^0_3$ and determine the exact complexities it can have. In contrast, we show that if $X$ is not second countable then the family of monitorable sets can be much more complex, giving an example where it is $ \\Pi^1_1$-complete.","authors_text":"Francesco Dagnino, Riccardo Camerlo","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-01-06T22:32:14Z","title":"The complexity of being monitorable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.04256","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:f90b1254f28c8b192bc68b12d975280d92b3c2b4cee0c78799a1ff948f898a97","target":"record","created_at":"2026-06-19T16:11:19Z","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":"80a09af772199c6a13b30c2784fe874a5f75afba9ac321e9f26e6d058fa340e2","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-01-06T22:32:14Z","title_canon_sha256":"cb013c8a3c6befa5aac8644cf73e0e963e99052c446dd9b51646f25d47a2bef2"},"schema_version":"1.0","source":{"id":"2601.04256","kind":"arxiv","version":2}},"canonical_sha256":"ab68f35f680eb8d5aa21366d51e450bbe53279382a519f4e5e22acdd698363d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab68f35f680eb8d5aa21366d51e450bbe53279382a519f4e5e22acdd698363d9","first_computed_at":"2026-06-19T16:11:19.081134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:19.081134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2JWNVPxPb6Z+I4QiXpmJPcyTVEXX0fEghzjzQ9mFOXdSdm543ISdVy0i6NLB0X9ZIJPpCXNfGOYK1M6oYsl8CQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:19.081524Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.04256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f90b1254f28c8b192bc68b12d975280d92b3c2b4cee0c78799a1ff948f898a97","sha256:d9971f077188217abec9f4f5958e15e08c80f8fbc97286c328de0a788c3c1782"],"state_sha256":"b61af05bfc3b1d6f0964c57d11f6dd83f5cc9246c00dfffc2429b313a068fe4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHsulUF1mLznj6i+qP5PAfUMJVbA4og67hBp4oATwX4Y/buPb+3ZLsb9BmnjhxEpbrvL6tUoO23BQOOze+J+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T10:41:29.376294Z","bundle_sha256":"5fb3084fee5ff0e4cca14e637afbe966062f6a72c0a5da07c7efadd3545b0aa3"}}