{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7LZO3HVKNK7CLPDU6PZYS4BHIY","short_pith_number":"pith:7LZO3HVK","canonical_record":{"source":{"id":"2411.15940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2024-11-24T17:59:08Z","cross_cats_sorted":[],"title_canon_sha256":"90415d798869ca922f2656186980ad8626d6f74733c2f585ec569e7251ac4558","abstract_canon_sha256":"a061f9af8d08fa75fbe734f10eac51fc2baa2d78ed869f398ceaa5cdf78ce197"},"schema_version":"1.0"},"canonical_sha256":"faf2ed9eaa6abe25bc74f3f38970274637c720d3322f41bdb399f2107e84ec47","source":{"kind":"arxiv","id":"2411.15940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15940","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15940v1","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15940","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"pith_short_12","alias_value":"7LZO3HVKNK7C","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"pith_short_16","alias_value":"7LZO3HVKNK7CLPDU","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"pith_short_8","alias_value":"7LZO3HVK","created_at":"2026-07-05T09:39:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7LZO3HVKNK7CLPDU6PZYS4BHIY","target":"record","payload":{"canonical_record":{"source":{"id":"2411.15940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2024-11-24T17:59:08Z","cross_cats_sorted":[],"title_canon_sha256":"90415d798869ca922f2656186980ad8626d6f74733c2f585ec569e7251ac4558","abstract_canon_sha256":"a061f9af8d08fa75fbe734f10eac51fc2baa2d78ed869f398ceaa5cdf78ce197"},"schema_version":"1.0"},"canonical_sha256":"faf2ed9eaa6abe25bc74f3f38970274637c720d3322f41bdb399f2107e84ec47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:44.003137Z","signature_b64":"E6fAoW3md4mr7+9QP5np89RoGr17il85DC8gUekgv4nOPi97g6+lhUhVKwt3WtJ3PTtZ6P4Il7vP/hkTUNqvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faf2ed9eaa6abe25bc74f3f38970274637c720d3322f41bdb399f2107e84ec47","last_reissued_at":"2026-07-05T09:39:44.002686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:44.002686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.15940","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-05T09:39:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8zivH4Na34FX2e2q84n7YSQ//tw5xuWS/PMYdYz9x2hthukj1vuVwYZnIK3tNaHBvKRfjTQnJbuyqLCoaZRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T09:22:59.803134Z"},"content_sha256":"cd25dc734c1c4f02819ba31e9e981887f37dd8268768db698672b90971fa5e55","schema_version":"1.0","event_id":"sha256:cd25dc734c1c4f02819ba31e9e981887f37dd8268768db698672b90971fa5e55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7LZO3HVKNK7CLPDU6PZYS4BHIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tho Modal Logic of Minimal Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"S{\\o}ren Brinck Knudstorp","submitted_at":"2024-11-24T17:59:08Z","abstract_excerpt":"To formalize patterns of information increase and decrease, Van Benthem (1996) proposed modal information logic (MIL), a modal logic over partial orders. In MIL, points are interpreted as information states and least upper bounds, when existent, as informational sums. A natural counterpart to this logic is the modal logic of minimal upper bounds (MIN), interpreting minimal, rather than least, upper bounds as informational sums.\n  This paper presents the logic MIN, and in the main result, it is shown that the modal language cannot distinguish the two interpretations: a formula is valid in MIN i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15940","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/2411.15940/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-05T09:39:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2fg7LDD5oCPU/x7EdcVVJykb9juA9/M9R+tprnmBBnPwwokkp67DTMYe+k/M/X609/gxdJVIz6OUtp/ZxYCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T09:22:59.804046Z"},"content_sha256":"968464cc95329d3e8ccf1d5e7de2d3c764aa29c6419affd4dc3178cd8dba5a43","schema_version":"1.0","event_id":"sha256:968464cc95329d3e8ccf1d5e7de2d3c764aa29c6419affd4dc3178cd8dba5a43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LZO3HVKNK7CLPDU6PZYS4BHIY/bundle.json","state_url":"https://pith.science/pith/7LZO3HVKNK7CLPDU6PZYS4BHIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LZO3HVKNK7CLPDU6PZYS4BHIY/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-13T09:22:59Z","links":{"resolver":"https://pith.science/pith/7LZO3HVKNK7CLPDU6PZYS4BHIY","bundle":"https://pith.science/pith/7LZO3HVKNK7CLPDU6PZYS4BHIY/bundle.json","state":"https://pith.science/pith/7LZO3HVKNK7CLPDU6PZYS4BHIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LZO3HVKNK7CLPDU6PZYS4BHIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7LZO3HVKNK7CLPDU6PZYS4BHIY","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":"a061f9af8d08fa75fbe734f10eac51fc2baa2d78ed869f398ceaa5cdf78ce197","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2024-11-24T17:59:08Z","title_canon_sha256":"90415d798869ca922f2656186980ad8626d6f74733c2f585ec569e7251ac4558"},"schema_version":"1.0","source":{"id":"2411.15940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15940","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15940v1","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15940","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"pith_short_12","alias_value":"7LZO3HVKNK7C","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"pith_short_16","alias_value":"7LZO3HVKNK7CLPDU","created_at":"2026-07-05T09:39:44Z"},{"alias_kind":"pith_short_8","alias_value":"7LZO3HVK","created_at":"2026-07-05T09:39:44Z"}],"graph_snapshots":[{"event_id":"sha256:968464cc95329d3e8ccf1d5e7de2d3c764aa29c6419affd4dc3178cd8dba5a43","target":"graph","created_at":"2026-07-05T09:39:44Z","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/2411.15940/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To formalize patterns of information increase and decrease, Van Benthem (1996) proposed modal information logic (MIL), a modal logic over partial orders. In MIL, points are interpreted as information states and least upper bounds, when existent, as informational sums. A natural counterpart to this logic is the modal logic of minimal upper bounds (MIN), interpreting minimal, rather than least, upper bounds as informational sums.\n  This paper presents the logic MIN, and in the main result, it is shown that the modal language cannot distinguish the two interpretations: a formula is valid in MIN i","authors_text":"S{\\o}ren Brinck Knudstorp","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2024-11-24T17:59:08Z","title":"Tho Modal Logic of Minimal Upper Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15940","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:cd25dc734c1c4f02819ba31e9e981887f37dd8268768db698672b90971fa5e55","target":"record","created_at":"2026-07-05T09:39:44Z","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":"a061f9af8d08fa75fbe734f10eac51fc2baa2d78ed869f398ceaa5cdf78ce197","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2024-11-24T17:59:08Z","title_canon_sha256":"90415d798869ca922f2656186980ad8626d6f74733c2f585ec569e7251ac4558"},"schema_version":"1.0","source":{"id":"2411.15940","kind":"arxiv","version":1}},"canonical_sha256":"faf2ed9eaa6abe25bc74f3f38970274637c720d3322f41bdb399f2107e84ec47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faf2ed9eaa6abe25bc74f3f38970274637c720d3322f41bdb399f2107e84ec47","first_computed_at":"2026-07-05T09:39:44.002686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:44.002686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E6fAoW3md4mr7+9QP5np89RoGr17il85DC8gUekgv4nOPi97g6+lhUhVKwt3WtJ3PTtZ6P4Il7vP/hkTUNqvDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:44.003137Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.15940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd25dc734c1c4f02819ba31e9e981887f37dd8268768db698672b90971fa5e55","sha256:968464cc95329d3e8ccf1d5e7de2d3c764aa29c6419affd4dc3178cd8dba5a43"],"state_sha256":"30a310331d948df54adf6502b0fdf40c64e10990c159d618f5da098a77d67c28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fT8E6yhZEauThrCe+OYfzjT231puen3P6En6Ejxi2Ep1v4aNuwiFIpQVAKa0osYrW5kv43yqNq+0fu9NuT2GAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T09:22:59.809323Z","bundle_sha256":"522dcd1b692c5fe1493e42117cf8c69a602efb87750fdd36eac63eea93191c5d"}}