{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BZ3X3ZXGBLPTUWQ7NX36VMM6N3","short_pith_number":"pith:BZ3X3ZXG","canonical_record":{"source":{"id":"1712.08516","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T15:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"579392ef5e0177bbb1c9b1690edccd62972528fbbe606ffaddfe27ec983d7009","abstract_canon_sha256":"2a54ce4efbfad86b3faf7bcfa19ea30dc35b778d6698d451262785cbef53aba2"},"schema_version":"1.0"},"canonical_sha256":"0e777de6e60adf3a5a1f6df7eab19e6ed45db3512110293e86bfca24b423c4fb","source":{"kind":"arxiv","id":"1712.08516","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08516","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08516v2","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08516","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"BZ3X3ZXGBLPT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BZ3X3ZXGBLPTUWQ7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BZ3X3ZXG","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BZ3X3ZXGBLPTUWQ7NX36VMM6N3","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08516","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T15:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"579392ef5e0177bbb1c9b1690edccd62972528fbbe606ffaddfe27ec983d7009","abstract_canon_sha256":"2a54ce4efbfad86b3faf7bcfa19ea30dc35b778d6698d451262785cbef53aba2"},"schema_version":"1.0"},"canonical_sha256":"0e777de6e60adf3a5a1f6df7eab19e6ed45db3512110293e86bfca24b423c4fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:44.498893Z","signature_b64":"SE/XQsPCXtT5B7Jzdg2k67I9AKedXhb/xLkLwp9H6L3CAKzyJVp1aexO6/aprc2pQaeb0QWpGTjjtnNIgAHJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e777de6e60adf3a5a1f6df7eab19e6ed45db3512110293e86bfca24b423c4fb","last_reissued_at":"2026-05-18T00:16:44.498224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:44.498224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08516","source_version":2,"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-18T00:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tq1+DEY28ziOQ2/Eomi7n7Hbakomz3TDGr9R2tbpf9pXRUkt4LwjrwamHoKxbGFXhxJqp1IZeY/B02f9LY+HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:31:31.405578Z"},"content_sha256":"51de9017134866d30509139bf998edc3f2a0df8e684556f9af8c67e256594587","schema_version":"1.0","event_id":"sha256:51de9017134866d30509139bf998edc3f2a0df8e684556f9af8c67e256594587"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BZ3X3ZXGBLPTUWQ7NX36VMM6N3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A syntactic approach to the MacNeille completion of $\\bold\\Lambda^{\\ast}$, the free monoid over an ordered alphabet $\\bold \\Lambda$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hans-J\\\"urgen Bandelt, Maurice Pouzet","submitted_at":"2017-12-22T15:29:07Z","abstract_excerpt":"Let $\\Lambda^{\\ast}$ be the free monoid of (finite) words over a not necessarily finite alphabet $\\Lambda$, which is equipped with some (partial) order. This ordering lifts to $\\Lambda^{\\ast}$, where it extends the divisibility ordering of words. The MacNeille completion of $\\Lambda^{\\ast}$ constitutes a complete lattice ordered monoid and is realized by the system of \"closed\" lower sets in $\\Lambda^*$ (ordered by inclusion) or its isomorphic copy formed of the \"closed\" upper sets (ordered by reverse inclusion). Under some additional hypothesis on $\\Lambda$, one can easily identify the closed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08516","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"},"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-18T00:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pU+h51LuAimy9J+OtnZh/+Z8dQgQh2tVu7cCN1MNELfgttqZ4n5qBw6yoWbMgZQstFSkhc+hZMvsO/iGD1leCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:31:31.405938Z"},"content_sha256":"970e0c65aef9839adbecc11af08c20cab1e5b6ac0a39f322f36ae510f99c25e2","schema_version":"1.0","event_id":"sha256:970e0c65aef9839adbecc11af08c20cab1e5b6ac0a39f322f36ae510f99c25e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZ3X3ZXGBLPTUWQ7NX36VMM6N3/bundle.json","state_url":"https://pith.science/pith/BZ3X3ZXGBLPTUWQ7NX36VMM6N3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZ3X3ZXGBLPTUWQ7NX36VMM6N3/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-04T10:31:31Z","links":{"resolver":"https://pith.science/pith/BZ3X3ZXGBLPTUWQ7NX36VMM6N3","bundle":"https://pith.science/pith/BZ3X3ZXGBLPTUWQ7NX36VMM6N3/bundle.json","state":"https://pith.science/pith/BZ3X3ZXGBLPTUWQ7NX36VMM6N3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZ3X3ZXGBLPTUWQ7NX36VMM6N3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BZ3X3ZXGBLPTUWQ7NX36VMM6N3","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":"2a54ce4efbfad86b3faf7bcfa19ea30dc35b778d6698d451262785cbef53aba2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T15:29:07Z","title_canon_sha256":"579392ef5e0177bbb1c9b1690edccd62972528fbbe606ffaddfe27ec983d7009"},"schema_version":"1.0","source":{"id":"1712.08516","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08516","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08516v2","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08516","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"BZ3X3ZXGBLPT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BZ3X3ZXGBLPTUWQ7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BZ3X3ZXG","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:970e0c65aef9839adbecc11af08c20cab1e5b6ac0a39f322f36ae510f99c25e2","target":"graph","created_at":"2026-05-18T00:16:44Z","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":"Let $\\Lambda^{\\ast}$ be the free monoid of (finite) words over a not necessarily finite alphabet $\\Lambda$, which is equipped with some (partial) order. This ordering lifts to $\\Lambda^{\\ast}$, where it extends the divisibility ordering of words. The MacNeille completion of $\\Lambda^{\\ast}$ constitutes a complete lattice ordered monoid and is realized by the system of \"closed\" lower sets in $\\Lambda^*$ (ordered by inclusion) or its isomorphic copy formed of the \"closed\" upper sets (ordered by reverse inclusion). Under some additional hypothesis on $\\Lambda$, one can easily identify the closed ","authors_text":"Hans-J\\\"urgen Bandelt, Maurice Pouzet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T15:29:07Z","title":"A syntactic approach to the MacNeille completion of $\\bold\\Lambda^{\\ast}$, the free monoid over an ordered alphabet $\\bold \\Lambda$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08516","kind":"arxiv","version":2},"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:51de9017134866d30509139bf998edc3f2a0df8e684556f9af8c67e256594587","target":"record","created_at":"2026-05-18T00:16:44Z","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":"2a54ce4efbfad86b3faf7bcfa19ea30dc35b778d6698d451262785cbef53aba2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T15:29:07Z","title_canon_sha256":"579392ef5e0177bbb1c9b1690edccd62972528fbbe606ffaddfe27ec983d7009"},"schema_version":"1.0","source":{"id":"1712.08516","kind":"arxiv","version":2}},"canonical_sha256":"0e777de6e60adf3a5a1f6df7eab19e6ed45db3512110293e86bfca24b423c4fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e777de6e60adf3a5a1f6df7eab19e6ed45db3512110293e86bfca24b423c4fb","first_computed_at":"2026-05-18T00:16:44.498224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:44.498224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SE/XQsPCXtT5B7Jzdg2k67I9AKedXhb/xLkLwp9H6L3CAKzyJVp1aexO6/aprc2pQaeb0QWpGTjjtnNIgAHJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:44.498893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08516","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51de9017134866d30509139bf998edc3f2a0df8e684556f9af8c67e256594587","sha256:970e0c65aef9839adbecc11af08c20cab1e5b6ac0a39f322f36ae510f99c25e2"],"state_sha256":"1a3769f28f91827c73986fe473c45c75a15f386c7b07270956916b051d5b1b03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tFACN99v4T3d9pgTUJBUk0vjtR7gs+nCQ/eMaCsFQ6dFvlL2RZlxYsquySoefoS3m7CIjhzY/9By9vsT5E9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:31:31.408064Z","bundle_sha256":"597441e552b0b925164accae083c33e8ef114a852f6a44dc32788f3c6512e5c6"}}