{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HL3622RXVLKQHGZWKVKUWPBLXN","short_pith_number":"pith:HL3622RX","schema_version":"1.0","canonical_sha256":"3af7ed6a37aad5039b3655554b3c2bbb7794ad9b166824253740114cc354efd3","source":{"kind":"arxiv","id":"1507.00600","version":1},"attestation_state":"computed","paper":{"title":"Embedding rationally independent languages into maximal ones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Mitja Mastnak, Stavros Konstantinidis","submitted_at":"2015-07-02T14:21:03Z","abstract_excerpt":"We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language $L$, find a maximal independent language containing $L$. We consider the case where the code-related property is defined via a rational binary relation that is decreasing with respect to any fixed total order on the set of words. Our method works by iterating a max-min operator that has been used before for the embedding problem for properties defined by length-increasing-and-transitive binary relations. By going to order-decreasing rational relations, represented by "},"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":"1507.00600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-02T14:21:03Z","cross_cats_sorted":[],"title_canon_sha256":"8c3024444bcc7fd07d24337f096454aee75aa8da429756e19ef02a7db734c7cf","abstract_canon_sha256":"179f8fdc281d17a08e6ae0ca5ea835940f9d35eb3b666c2f7e082f3db37f4029"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.149573Z","signature_b64":"rqh5GCO/4O2pOueOfc5g1/1TfiDH9nU0tAlRe78RoPBvEWjuPnemvPVBlRpTcCXikvIsIvtYtpXlbz1QRqtNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3af7ed6a37aad5039b3655554b3c2bbb7794ad9b166824253740114cc354efd3","last_reissued_at":"2026-05-18T01:37:24.148864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.148864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding rationally independent languages into maximal ones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Mitja Mastnak, Stavros Konstantinidis","submitted_at":"2015-07-02T14:21:03Z","abstract_excerpt":"We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language $L$, find a maximal independent language containing $L$. We consider the case where the code-related property is defined via a rational binary relation that is decreasing with respect to any fixed total order on the set of words. Our method works by iterating a max-min operator that has been used before for the embedding problem for properties defined by length-increasing-and-transitive binary relations. By going to order-decreasing rational relations, represented by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00600","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":"1507.00600","created_at":"2026-05-18T01:37:24.148964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00600v1","created_at":"2026-05-18T01:37:24.148964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00600","created_at":"2026-05-18T01:37:24.148964+00:00"},{"alias_kind":"pith_short_12","alias_value":"HL3622RXVLKQ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HL3622RXVLKQHGZW","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HL3622RX","created_at":"2026-05-18T12:29:25.134429+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/HL3622RXVLKQHGZWKVKUWPBLXN","json":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN.json","graph_json":"https://pith.science/api/pith-number/HL3622RXVLKQHGZWKVKUWPBLXN/graph.json","events_json":"https://pith.science/api/pith-number/HL3622RXVLKQHGZWKVKUWPBLXN/events.json","paper":"https://pith.science/paper/HL3622RX"},"agent_actions":{"view_html":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN","download_json":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN.json","view_paper":"https://pith.science/paper/HL3622RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00600&json=true","fetch_graph":"https://pith.science/api/pith-number/HL3622RXVLKQHGZWKVKUWPBLXN/graph.json","fetch_events":"https://pith.science/api/pith-number/HL3622RXVLKQHGZWKVKUWPBLXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/action/storage_attestation","attest_author":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/action/author_attestation","sign_citation":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/action/citation_signature","submit_replication":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/action/replication_record"}},"created_at":"2026-05-18T01:37:24.148964+00:00","updated_at":"2026-05-18T01:37:24.148964+00:00"}