{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UJ7FNGPK6QZ3YHWCJZFWH5P7W7","short_pith_number":"pith:UJ7FNGPK","canonical_record":{"source":{"id":"1701.05001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-18T10:33:52Z","cross_cats_sorted":[],"title_canon_sha256":"7ea2ae4f96e1b35983f9a580e3fef40d6c6b3107f06ce58c2127f3fc46721371","abstract_canon_sha256":"25540eb9ded975016032db578c0602e1ca319e30ac7761416e7f57a2729cd03e"},"schema_version":"1.0"},"canonical_sha256":"a27e5699eaf433bc1ec24e4b63f5ffb7ee310007c3c7af24d7a711b28b90341f","source":{"kind":"arxiv","id":"1701.05001","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05001","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05001v2","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05001","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"UJ7FNGPK6QZ3","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UJ7FNGPK6QZ3YHWC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UJ7FNGPK","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UJ7FNGPK6QZ3YHWCJZFWH5P7W7","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-18T10:33:52Z","cross_cats_sorted":[],"title_canon_sha256":"7ea2ae4f96e1b35983f9a580e3fef40d6c6b3107f06ce58c2127f3fc46721371","abstract_canon_sha256":"25540eb9ded975016032db578c0602e1ca319e30ac7761416e7f57a2729cd03e"},"schema_version":"1.0"},"canonical_sha256":"a27e5699eaf433bc1ec24e4b63f5ffb7ee310007c3c7af24d7a711b28b90341f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:22.135054Z","signature_b64":"///vXaf23oRZtysI2LdS0c9w4laFGZddXV66hMk5uLciAWlv1WyatKxyG9Nk54VRxA3b/oBR3mAH8PKy64yCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a27e5699eaf433bc1ec24e4b63f5ffb7ee310007c3c7af24d7a711b28b90341f","last_reissued_at":"2026-05-18T00:52:22.134233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:22.134233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05001","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-18T00:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4lJaWKyA3seqsPEb2R1l3JcZiNMTbGP//VG96J/fMDNECMaIWZwKWx9jJm9hwCEZqeLUS4ldlZLaZmDydF2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:22:41.539575Z"},"content_sha256":"4892770ddb76e8b94586153c80c5ff1e71d332a91e55d245f4d5e943d6358efa","schema_version":"1.0","event_id":"sha256:4892770ddb76e8b94586153c80c5ff1e71d332a91e55d245f4d5e943d6358efa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UJ7FNGPK6QZ3YHWCJZFWH5P7W7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Up-To Techniques for Weighted Systems (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Barbara K\\\"onig, Filippo Bonchi, Sebastian K\\\"upper","submitted_at":"2017-01-18T10:33:52Z","abstract_excerpt":"We show how up-to techniques for (bi-)similarity can be used in the setting of weighted systems. The problems we consider are language equivalence, language inclusion and the threshold problem (also known as universality problem) for weighted automata. We build a bisimulation relation on the fly and work up-to congruence and up-to similarity. This requires to determine whether a pair of vectors (over a semiring) is in the congruence closure of a given relation of vectors. This problem is considered for rings and l-monoids, for the latter we provide a rewriting algorithm and show its confluence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05001","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":""},"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:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+Mp2pZuCA8uvQuHQUd0ssEx2/BTU/yEvwGWjeqcW6KWHn1aee9ytDegINHopiDl6dFNtmFNSm+B4uPXKIzPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:22:41.540153Z"},"content_sha256":"a7cfd719368d0a03cd6756d941dd867be5f3f6263fb393abe0e9d671cbbd3534","schema_version":"1.0","event_id":"sha256:a7cfd719368d0a03cd6756d941dd867be5f3f6263fb393abe0e9d671cbbd3534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJ7FNGPK6QZ3YHWCJZFWH5P7W7/bundle.json","state_url":"https://pith.science/pith/UJ7FNGPK6QZ3YHWCJZFWH5P7W7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJ7FNGPK6QZ3YHWCJZFWH5P7W7/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-05T00:22:41Z","links":{"resolver":"https://pith.science/pith/UJ7FNGPK6QZ3YHWCJZFWH5P7W7","bundle":"https://pith.science/pith/UJ7FNGPK6QZ3YHWCJZFWH5P7W7/bundle.json","state":"https://pith.science/pith/UJ7FNGPK6QZ3YHWCJZFWH5P7W7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJ7FNGPK6QZ3YHWCJZFWH5P7W7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UJ7FNGPK6QZ3YHWCJZFWH5P7W7","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":"25540eb9ded975016032db578c0602e1ca319e30ac7761416e7f57a2729cd03e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-18T10:33:52Z","title_canon_sha256":"7ea2ae4f96e1b35983f9a580e3fef40d6c6b3107f06ce58c2127f3fc46721371"},"schema_version":"1.0","source":{"id":"1701.05001","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05001","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05001v2","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05001","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"UJ7FNGPK6QZ3","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UJ7FNGPK6QZ3YHWC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UJ7FNGPK","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:a7cfd719368d0a03cd6756d941dd867be5f3f6263fb393abe0e9d671cbbd3534","target":"graph","created_at":"2026-05-18T00:52:22Z","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":"We show how up-to techniques for (bi-)similarity can be used in the setting of weighted systems. The problems we consider are language equivalence, language inclusion and the threshold problem (also known as universality problem) for weighted automata. We build a bisimulation relation on the fly and work up-to congruence and up-to similarity. This requires to determine whether a pair of vectors (over a semiring) is in the congruence closure of a given relation of vectors. This problem is considered for rings and l-monoids, for the latter we provide a rewriting algorithm and show its confluence","authors_text":"Barbara K\\\"onig, Filippo Bonchi, Sebastian K\\\"upper","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-18T10:33:52Z","title":"Up-To Techniques for Weighted Systems (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05001","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:4892770ddb76e8b94586153c80c5ff1e71d332a91e55d245f4d5e943d6358efa","target":"record","created_at":"2026-05-18T00:52:22Z","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":"25540eb9ded975016032db578c0602e1ca319e30ac7761416e7f57a2729cd03e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-18T10:33:52Z","title_canon_sha256":"7ea2ae4f96e1b35983f9a580e3fef40d6c6b3107f06ce58c2127f3fc46721371"},"schema_version":"1.0","source":{"id":"1701.05001","kind":"arxiv","version":2}},"canonical_sha256":"a27e5699eaf433bc1ec24e4b63f5ffb7ee310007c3c7af24d7a711b28b90341f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a27e5699eaf433bc1ec24e4b63f5ffb7ee310007c3c7af24d7a711b28b90341f","first_computed_at":"2026-05-18T00:52:22.134233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:22.134233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"///vXaf23oRZtysI2LdS0c9w4laFGZddXV66hMk5uLciAWlv1WyatKxyG9Nk54VRxA3b/oBR3mAH8PKy64yCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:22.135054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05001","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4892770ddb76e8b94586153c80c5ff1e71d332a91e55d245f4d5e943d6358efa","sha256:a7cfd719368d0a03cd6756d941dd867be5f3f6263fb393abe0e9d671cbbd3534"],"state_sha256":"2dc265e873ee1f8ae4941812a93ac3ab2a9c47eaf5e32d388d702c13223c6a71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LGAmpwyrbg39mDAtVNiwp0/Q9Tc9gSkVSTqUshpN3xOqlyqfdxT3Jatf7YFXtMthvrWA1qhpg8IKDXLufQlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:22:41.543043Z","bundle_sha256":"7fd973963362587c954233759d21d519c435ecc53feab0652b8f13dd1bbc8299"}}