{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HL3622RXVLKQHGZWKVKUWPBLXN","short_pith_number":"pith:HL3622RX","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"},"canonical_sha256":"3af7ed6a37aad5039b3655554b3c2bbb7794ad9b166824253740114cc354efd3","source":{"kind":"arxiv","id":"1507.00600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00600","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00600v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00600","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"HL3622RXVLKQ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HL3622RXVLKQHGZW","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HL3622RX","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HL3622RXVLKQHGZWKVKUWPBLXN","target":"record","payload":{"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"},"canonical_sha256":"3af7ed6a37aad5039b3655554b3c2bbb7794ad9b166824253740114cc354efd3","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"},"source_kind":"arxiv","source_id":"1507.00600","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-18T01:37:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnlp2x/UIxza2tx9X8x8M2CA/4NJ2vK2IfslZxecR+FFWv+8MW3hCRyfcv4Id7fi2/TjCk0dYR3DPvmwFzMwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:45:56.541948Z"},"content_sha256":"0597ecd91f1ebce0506646774e15374dd5d4fe8a0d1c080820887a07081d25bc","schema_version":"1.0","event_id":"sha256:0597ecd91f1ebce0506646774e15374dd5d4fe8a0d1c080820887a07081d25bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HL3622RXVLKQHGZWKVKUWPBLXN","target":"graph","payload":{"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"},"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-18T01:37:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjbIzB8DZpJBSLy9O9TU/fvPh5T/hccoZGRCrEwzGklQ5uP4oaB3TGlpy5ytxF9eQ9SwnY/2KcFFMMIRp59zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:45:56.542288Z"},"content_sha256":"667da93dc25f659828a4cbc35f2ff51d74fbed82bd22c2b0df3379a3f181c031","schema_version":"1.0","event_id":"sha256:667da93dc25f659828a4cbc35f2ff51d74fbed82bd22c2b0df3379a3f181c031"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/bundle.json","state_url":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HL3622RXVLKQHGZWKVKUWPBLXN/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-24T12:45:56Z","links":{"resolver":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN","bundle":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/bundle.json","state":"https://pith.science/pith/HL3622RXVLKQHGZWKVKUWPBLXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HL3622RXVLKQHGZWKVKUWPBLXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HL3622RXVLKQHGZWKVKUWPBLXN","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":"179f8fdc281d17a08e6ae0ca5ea835940f9d35eb3b666c2f7e082f3db37f4029","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-02T14:21:03Z","title_canon_sha256":"8c3024444bcc7fd07d24337f096454aee75aa8da429756e19ef02a7db734c7cf"},"schema_version":"1.0","source":{"id":"1507.00600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00600","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00600v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00600","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"HL3622RXVLKQ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HL3622RXVLKQHGZW","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HL3622RX","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:667da93dc25f659828a4cbc35f2ff51d74fbed82bd22c2b0df3379a3f181c031","target":"graph","created_at":"2026-05-18T01:37:24Z","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 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 ","authors_text":"Mitja Mastnak, Stavros Konstantinidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-02T14:21:03Z","title":"Embedding rationally independent languages into maximal ones"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00600","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:0597ecd91f1ebce0506646774e15374dd5d4fe8a0d1c080820887a07081d25bc","target":"record","created_at":"2026-05-18T01:37:24Z","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":"179f8fdc281d17a08e6ae0ca5ea835940f9d35eb3b666c2f7e082f3db37f4029","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-02T14:21:03Z","title_canon_sha256":"8c3024444bcc7fd07d24337f096454aee75aa8da429756e19ef02a7db734c7cf"},"schema_version":"1.0","source":{"id":"1507.00600","kind":"arxiv","version":1}},"canonical_sha256":"3af7ed6a37aad5039b3655554b3c2bbb7794ad9b166824253740114cc354efd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3af7ed6a37aad5039b3655554b3c2bbb7794ad9b166824253740114cc354efd3","first_computed_at":"2026-05-18T01:37:24.148864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:24.148864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rqh5GCO/4O2pOueOfc5g1/1TfiDH9nU0tAlRe78RoPBvEWjuPnemvPVBlRpTcCXikvIsIvtYtpXlbz1QRqtNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:24.149573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0597ecd91f1ebce0506646774e15374dd5d4fe8a0d1c080820887a07081d25bc","sha256:667da93dc25f659828a4cbc35f2ff51d74fbed82bd22c2b0df3379a3f181c031"],"state_sha256":"9a0d26a7ec8a94b16c4aae7c26884de7140dd9d0f605f892d3dbd8ec2d3b5031"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Crbt45Eiov8zcjiCz8H4H5R1DCuWIpPZNAs3SFhj8krzoM561+rIFSUrh/W88dub2y+Q8LhjbfC7NkZLj6mBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:45:56.544259Z","bundle_sha256":"6bfdfb04984565e1775b298e501163f80c5da1bd0ece23910005684e6abea8c6"}}