{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MMCVFOF2FR4SYVG7JI2TK5QQCS","short_pith_number":"pith:MMCVFOF2","schema_version":"1.0","canonical_sha256":"630552b8ba2c792c54df4a3535761014af1dad20c4cbb7f77c25d8233ec76a67","source":{"kind":"arxiv","id":"1903.10740","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.10740","created_at":"2026-05-17T23:50:17.870020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10740v1","created_at":"2026-05-17T23:50:17.870020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10740","created_at":"2026-05-17T23:50:17.870020+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMCVFOF2FR4S","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMCVFOF2FR4SYVG7","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMCVFOF2","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS","json":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS.json","graph_json":"https://pith.science/api/pith-number/MMCVFOF2FR4SYVG7JI2TK5QQCS/graph.json","events_json":"https://pith.science/api/pith-number/MMCVFOF2FR4SYVG7JI2TK5QQCS/events.json","paper":"https://pith.science/paper/MMCVFOF2"},"agent_actions":{"view_html":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS","download_json":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS.json","view_paper":"https://pith.science/paper/MMCVFOF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10740&json=true","fetch_graph":"https://pith.science/api/pith-number/MMCVFOF2FR4SYVG7JI2TK5QQCS/graph.json","fetch_events":"https://pith.science/api/pith-number/MMCVFOF2FR4SYVG7JI2TK5QQCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/action/storage_attestation","attest_author":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/action/author_attestation","sign_citation":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/action/citation_signature","submit_replication":"https://pith.science/pith/MMCVFOF2FR4SYVG7JI2TK5QQCS/action/replication_record"}},"created_at":"2026-05-17T23:50:17.870020+00:00","updated_at":"2026-05-17T23:50:17.870020+00:00"}