{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NVFBSD2E2V2BK4EEQVVOMEJG3B","short_pith_number":"pith:NVFBSD2E","canonical_record":{"source":{"id":"1803.11034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-03-29T12:49:58Z","cross_cats_sorted":["cs.FL","math.OC"],"title_canon_sha256":"c250deb44c3f650fc3d17c06bdbefb9d96d091cd8b2acf3ce5ef4cdf2a84a44b","abstract_canon_sha256":"2e5db0aba712398707dce33ae0bffacf2666ec82e7d2518d90268d182dd5b61b"},"schema_version":"1.0"},"canonical_sha256":"6d4a190f44d574157084856ae61126d8549f3232edb3434adab9360a8aef5933","source":{"kind":"arxiv","id":"1803.11034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11034","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11034v1","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11034","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"pith_short_12","alias_value":"NVFBSD2E2V2B","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NVFBSD2E2V2BK4EE","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NVFBSD2E","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NVFBSD2E2V2BK4EEQVVOMEJG3B","target":"record","payload":{"canonical_record":{"source":{"id":"1803.11034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-03-29T12:49:58Z","cross_cats_sorted":["cs.FL","math.OC"],"title_canon_sha256":"c250deb44c3f650fc3d17c06bdbefb9d96d091cd8b2acf3ce5ef4cdf2a84a44b","abstract_canon_sha256":"2e5db0aba712398707dce33ae0bffacf2666ec82e7d2518d90268d182dd5b61b"},"schema_version":"1.0"},"canonical_sha256":"6d4a190f44d574157084856ae61126d8549f3232edb3434adab9360a8aef5933","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:49.456924Z","signature_b64":"125UB6jsNrPY8WXPnQQ1Fc0Hnt5oGGMabdUCptBk+YlCwqH9U13IMlU5j/MzhLVQ/Lc4WN+fBwiIT4Ntd1iQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d4a190f44d574157084856ae61126d8549f3232edb3434adab9360a8aef5933","last_reissued_at":"2026-05-18T00:19:49.455944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:49.455944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.11034","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-05-18T00:19:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8g/JmKKIzqzuvFEEfzKj7/g1gvlDULTmosOWDHGOB6mwKgYT4ZyJD7tMYZ0hhRDjEH/sxqPFc/Xrwzrth59QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:20:49.464044Z"},"content_sha256":"523d3528c21adb66df8bb57ec75ebb93d7ca2b32f233edfbe5105cb43e0e505b","schema_version":"1.0","event_id":"sha256:523d3528c21adb66df8bb57ec75ebb93d7ca2b32f233edfbe5105cb43e0e505b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NVFBSD2E2V2BK4EEQVVOMEJG3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automatic Generation of Optimal Reductions of Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.OC"],"primary_cat":"cs.SY","authors_text":"Liyong Lin, Rong Su, Tom\\'a\\v{s} Masopust, W. Murray Wonham","submitted_at":"2018-03-29T12:49:58Z","abstract_excerpt":"A reduction of a source distribution is a collection of smaller sized distributions that are collectively equivalent to the source distribution with respect to the property of decomposability. That is, an arbitrary language is decomposable with respect to the source distribution if and only if it is decomposable with respect to each smaller sized distribution (in the reduction). The notion of reduction of distributions has previously been proposed to improve the complexity of decomposability verification. In this work, we address the problem of generating (optimal) reductions of distributions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11034","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":""},"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-18T00:19:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8mIzYYVEFwwnsY+NkkRLbD+Z3J6B66/ttkW38RcC1n7A3PboOXilWxl2aOtg2E2lcNM25DBuUIBJnpvXTaDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:20:49.464449Z"},"content_sha256":"e0ab1abfec3bfe50d0f9f2f3e06e77a70e5b5eb17ec2546ec13d4035aee13a62","schema_version":"1.0","event_id":"sha256:e0ab1abfec3bfe50d0f9f2f3e06e77a70e5b5eb17ec2546ec13d4035aee13a62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVFBSD2E2V2BK4EEQVVOMEJG3B/bundle.json","state_url":"https://pith.science/pith/NVFBSD2E2V2BK4EEQVVOMEJG3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVFBSD2E2V2BK4EEQVVOMEJG3B/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-05-27T00:20:49Z","links":{"resolver":"https://pith.science/pith/NVFBSD2E2V2BK4EEQVVOMEJG3B","bundle":"https://pith.science/pith/NVFBSD2E2V2BK4EEQVVOMEJG3B/bundle.json","state":"https://pith.science/pith/NVFBSD2E2V2BK4EEQVVOMEJG3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVFBSD2E2V2BK4EEQVVOMEJG3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NVFBSD2E2V2BK4EEQVVOMEJG3B","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":"2e5db0aba712398707dce33ae0bffacf2666ec82e7d2518d90268d182dd5b61b","cross_cats_sorted":["cs.FL","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-03-29T12:49:58Z","title_canon_sha256":"c250deb44c3f650fc3d17c06bdbefb9d96d091cd8b2acf3ce5ef4cdf2a84a44b"},"schema_version":"1.0","source":{"id":"1803.11034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11034","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11034v1","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11034","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"pith_short_12","alias_value":"NVFBSD2E2V2B","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NVFBSD2E2V2BK4EE","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NVFBSD2E","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:e0ab1abfec3bfe50d0f9f2f3e06e77a70e5b5eb17ec2546ec13d4035aee13a62","target":"graph","created_at":"2026-05-18T00:19:49Z","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":"A reduction of a source distribution is a collection of smaller sized distributions that are collectively equivalent to the source distribution with respect to the property of decomposability. That is, an arbitrary language is decomposable with respect to the source distribution if and only if it is decomposable with respect to each smaller sized distribution (in the reduction). The notion of reduction of distributions has previously been proposed to improve the complexity of decomposability verification. In this work, we address the problem of generating (optimal) reductions of distributions ","authors_text":"Liyong Lin, Rong Su, Tom\\'a\\v{s} Masopust, W. Murray Wonham","cross_cats":["cs.FL","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-03-29T12:49:58Z","title":"Automatic Generation of Optimal Reductions of Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11034","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:523d3528c21adb66df8bb57ec75ebb93d7ca2b32f233edfbe5105cb43e0e505b","target":"record","created_at":"2026-05-18T00:19:49Z","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":"2e5db0aba712398707dce33ae0bffacf2666ec82e7d2518d90268d182dd5b61b","cross_cats_sorted":["cs.FL","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-03-29T12:49:58Z","title_canon_sha256":"c250deb44c3f650fc3d17c06bdbefb9d96d091cd8b2acf3ce5ef4cdf2a84a44b"},"schema_version":"1.0","source":{"id":"1803.11034","kind":"arxiv","version":1}},"canonical_sha256":"6d4a190f44d574157084856ae61126d8549f3232edb3434adab9360a8aef5933","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d4a190f44d574157084856ae61126d8549f3232edb3434adab9360a8aef5933","first_computed_at":"2026-05-18T00:19:49.455944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:49.455944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"125UB6jsNrPY8WXPnQQ1Fc0Hnt5oGGMabdUCptBk+YlCwqH9U13IMlU5j/MzhLVQ/Lc4WN+fBwiIT4Ntd1iQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:49.456924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.11034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:523d3528c21adb66df8bb57ec75ebb93d7ca2b32f233edfbe5105cb43e0e505b","sha256:e0ab1abfec3bfe50d0f9f2f3e06e77a70e5b5eb17ec2546ec13d4035aee13a62"],"state_sha256":"e8fe925356cb97ff636802a8e5171384778ea350dfb74f5a1b965bb5a7303111"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hg/+QYYVXSDGdDP6pB0T7ULXTCZDMFVaWgIWEh2UXhTx5Uzu9wErmOpjH4VQs7u+wnQ348mE+qurP0tnf5GrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:20:49.466622Z","bundle_sha256":"228c9c453c7dc098c1459b0556f4513618b005fda66f5911fe320a7ba1106725"}}