{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M4GU24AONPIZKDIGWEWDOBUXSM","short_pith_number":"pith:M4GU24AO","schema_version":"1.0","canonical_sha256":"670d4d700e6bd1950d06b12c370697931224d75f24357547378d92724fa966d5","source":{"kind":"arxiv","id":"1702.06438","version":2},"attestation_state":"computed","paper":{"title":"The meet operation in the imbalance lattice of maximal instantaneous codes: alternative proof of existence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Stott Parker, Sandor Radeleczki, Stephan Foldes","submitted_at":"2017-02-21T15:30:24Z","abstract_excerpt":"An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree of 0-1 words. The proof proposed makes use of a single balancing operation instead of expansion and contraction as in the original proof of the existence of glb."},"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":"1702.06438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-21T15:30:24Z","cross_cats_sorted":[],"title_canon_sha256":"6811bde8334098955f7179a5d5bad2fb8b5e52c413bcddae4843ce977b6dd061","abstract_canon_sha256":"4207023b89a55c1c3137c87336f871d48f2e201d0bbc9de3358de2e34556ad26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:34.913539Z","signature_b64":"3HQY2J94slrH6G35Z9O1TIQr2AzRJtKVj37gK0oPLdFt4khLB81dNDNC+khBfIf5PzVpUZfjq4BR6bHGGTMbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670d4d700e6bd1950d06b12c370697931224d75f24357547378d92724fa966d5","last_reissued_at":"2026-05-18T00:33:34.913057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:34.913057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The meet operation in the imbalance lattice of maximal instantaneous codes: alternative proof of existence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Stott Parker, Sandor Radeleczki, Stephan Foldes","submitted_at":"2017-02-21T15:30:24Z","abstract_excerpt":"An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree of 0-1 words. The proof proposed makes use of a single balancing operation instead of expansion and contraction as in the original proof of the existence of glb."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06438","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.06438","created_at":"2026-05-18T00:33:34.913128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06438v2","created_at":"2026-05-18T00:33:34.913128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06438","created_at":"2026-05-18T00:33:34.913128+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4GU24AONPIZ","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4GU24AONPIZKDIG","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4GU24AO","created_at":"2026-05-18T12:31:28.150371+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/M4GU24AONPIZKDIGWEWDOBUXSM","json":"https://pith.science/pith/M4GU24AONPIZKDIGWEWDOBUXSM.json","graph_json":"https://pith.science/api/pith-number/M4GU24AONPIZKDIGWEWDOBUXSM/graph.json","events_json":"https://pith.science/api/pith-number/M4GU24AONPIZKDIGWEWDOBUXSM/events.json","paper":"https://pith.science/paper/M4GU24AO"},"agent_actions":{"view_html":"https://pith.science/pith/M4GU24AONPIZKDIGWEWDOBUXSM","download_json":"https://pith.science/pith/M4GU24AONPIZKDIGWEWDOBUXSM.json","view_paper":"https://pith.science/paper/M4GU24AO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06438&json=true","fetch_graph":"https://pith.science/api/pith-number/M4GU24AONPIZKDIGWEWDOBUXSM/graph.json","fetch_events":"https://pith.science/api/pith-number/M4GU24AONPIZKDIGWEWDOBUXSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4GU24AONPIZKDIGWEWDOBUXSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4GU24AONPIZKDIGWEWDOBUXSM/action/storage_attestation","attest_author":"https://pith.science/pith/M4GU24AONPIZKDIGWEWDOBUXSM/action/author_attestation","sign_citation":"https://pith.science/pith/M4GU24AONPIZKDIGWEWDOBUXSM/action/citation_signature","submit_replication":"https://pith.science/pith/M4GU24AONPIZKDIGWEWDOBUXSM/action/replication_record"}},"created_at":"2026-05-18T00:33:34.913128+00:00","updated_at":"2026-05-18T00:33:34.913128+00:00"}