{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MMCVFOF2FR4SYVG7JI2TK5QQCS","short_pith_number":"pith:MMCVFOF2","canonical_record":{"source":{"id":"1903.10740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-26T08:58:25Z","cross_cats_sorted":[],"title_canon_sha256":"c2f852625e7c59200853585c04bdceb65a46f5ab11196cb967c3523aab3b55e1","abstract_canon_sha256":"f1ece965bc81c9bb506da603a3e236e26cf59060105b0e2be438137ece2ee525"},"schema_version":"1.0"},"canonical_sha256":"630552b8ba2c792c54df4a3535761014af1dad20c4cbb7f77c25d8233ec76a67","source":{"kind":"arxiv","id":"1903.10740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10740","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10740v1","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10740","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"MMCVFOF2FR4S","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MMCVFOF2FR4SYVG7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MMCVFOF2","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MMCVFOF2FR4SYVG7JI2TK5QQCS","target":"record","payload":{"canonical_record":{"source":{"id":"1903.10740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-26T08:58:25Z","cross_cats_sorted":[],"title_canon_sha256":"c2f852625e7c59200853585c04bdceb65a46f5ab11196cb967c3523aab3b55e1","abstract_canon_sha256":"f1ece965bc81c9bb506da603a3e236e26cf59060105b0e2be438137ece2ee525"},"schema_version":"1.0"},"canonical_sha256":"630552b8ba2c792c54df4a3535761014af1dad20c4cbb7f77c25d8233ec76a67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:17.870410Z","signature_b64":"uG1uhNRzv5elFAqeTJqM66RSQJn9FIzIXJ+UxDk7M8JUoWCI5rlHQBtoISeaf2HQ+UXF0ObJbvB5VQM10VLOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630552b8ba2c792c54df4a3535761014af1dad20c4cbb7f77c25d8233ec76a67","last_reissued_at":"2026-05-17T23:50:17.869956Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:17.869956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.10740","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-17T23:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+u6xiN21UqkQTm6x5abm9+em04fm2Y9H8g0lt2bu0nWVHHP7vfDgP/n4apaQRwRcThh7U7IO3T8KuDOSnDMyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:39:22.568222Z"},"content_sha256":"5eb1536297310fcae99b3987adb45659028b3b16bc4d1bd90415e29d6580fdce","schema_version":"1.0","event_id":"sha256:5eb1536297310fcae99b3987adb45659028b3b16bc4d1bd90415e29d6580fdce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MMCVFOF2FR4SYVG7JI2TK5QQCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Juraj Sebej, Mitja Mastnak, Stavros Konstantinidis","submitted_at":"2019-03-26T08:58:25Z","abstract_excerpt":"We consider the problem of partitioning effectively a given symmetric (and irreflexive) rational relation R into two asymmetric rational relations. This problem is motivated by a recent method of embedding an R-independent language into one that is maximal R-independent, where the method requires to use an asymmetric partition of R. We solve the problem when R is realized by a zero-avoiding transducer (with some bound k): if the absolute value of the input-output length discrepancy of a computation exceeds k then the length discrepancy of the computation cannot become zero. This class of relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10740","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-17T23:50:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nnys25WNYHwI+s8Kar75HRTgmk+JDEvuvIUgfEsXL4tmwWX4fbZNTsztQUPdB92oPU/57jUuNnJyBTbeUrDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:39:22.568820Z"},"content_sha256":"708bfaa0116477b6713285ee92bdb6ff8e548eb9082080886dcaa6a9a1fcabe9","schema_version":"1.0","event_id":"sha256:708bfaa0116477b6713285ee92bdb6ff8e548eb9082080886dcaa6a9a1fcabe9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/bundle.json","state_url":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/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-31T09:39:22Z","links":{"resolver":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS","bundle":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/bundle.json","state":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MMCVFOF2FR4SYVG7JI2TK5QQCS","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":"f1ece965bc81c9bb506da603a3e236e26cf59060105b0e2be438137ece2ee525","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-26T08:58:25Z","title_canon_sha256":"c2f852625e7c59200853585c04bdceb65a46f5ab11196cb967c3523aab3b55e1"},"schema_version":"1.0","source":{"id":"1903.10740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10740","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10740v1","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10740","created_at":"2026-05-17T23:50:17Z"},{"alias_kind":"pith_short_12","alias_value":"MMCVFOF2FR4S","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MMCVFOF2FR4SYVG7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MMCVFOF2","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:708bfaa0116477b6713285ee92bdb6ff8e548eb9082080886dcaa6a9a1fcabe9","target":"graph","created_at":"2026-05-17T23:50:17Z","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 consider the problem of partitioning effectively a given symmetric (and irreflexive) rational relation R into two asymmetric rational relations. This problem is motivated by a recent method of embedding an R-independent language into one that is maximal R-independent, where the method requires to use an asymmetric partition of R. We solve the problem when R is realized by a zero-avoiding transducer (with some bound k): if the absolute value of the input-output length discrepancy of a computation exceeds k then the length discrepancy of the computation cannot become zero. This class of relat","authors_text":"Juraj Sebej, Mitja Mastnak, Stavros Konstantinidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-26T08:58:25Z","title":"Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10740","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:5eb1536297310fcae99b3987adb45659028b3b16bc4d1bd90415e29d6580fdce","target":"record","created_at":"2026-05-17T23:50:17Z","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":"f1ece965bc81c9bb506da603a3e236e26cf59060105b0e2be438137ece2ee525","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-26T08:58:25Z","title_canon_sha256":"c2f852625e7c59200853585c04bdceb65a46f5ab11196cb967c3523aab3b55e1"},"schema_version":"1.0","source":{"id":"1903.10740","kind":"arxiv","version":1}},"canonical_sha256":"630552b8ba2c792c54df4a3535761014af1dad20c4cbb7f77c25d8233ec76a67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"630552b8ba2c792c54df4a3535761014af1dad20c4cbb7f77c25d8233ec76a67","first_computed_at":"2026-05-17T23:50:17.869956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:17.869956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uG1uhNRzv5elFAqeTJqM66RSQJn9FIzIXJ+UxDk7M8JUoWCI5rlHQBtoISeaf2HQ+UXF0ObJbvB5VQM10VLOCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:17.870410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5eb1536297310fcae99b3987adb45659028b3b16bc4d1bd90415e29d6580fdce","sha256:708bfaa0116477b6713285ee92bdb6ff8e548eb9082080886dcaa6a9a1fcabe9"],"state_sha256":"86cc4a796e3d464f8c5a668ae766af6f004aed30036a7a39818542fd3c408ac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijvqXYp353TtatI1P+Ze89xDl16+VmnLVle5Gjozb9EQJDjQHJ5pt9jtP/pcBCUe2aik01AwkryK/3JK8aEIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:39:22.577640Z","bundle_sha256":"6b28b7462e5ca3eaa648cda80c140a6633076332b44fc93103f81900b858760a"}}