{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BNMDBBJL7473NP7JXUBOVGSEJZ","short_pith_number":"pith:BNMDBBJL","canonical_record":{"source":{"id":"1804.11217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-27T16:09:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fac1cf4dc89d4b63ea1cb72cf3c00dd338c9b7529885334175ab9f22bfda288b","abstract_canon_sha256":"3cd78f51fcd41b7af945477e09663f80846397b781c91b172efebc052836c535"},"schema_version":"1.0"},"canonical_sha256":"0b5830852bff3fb6bfe9bd02ea9a444e5a5f78856080b65fb7a2fea48ca66104","source":{"kind":"arxiv","id":"1804.11217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11217","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11217v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11217","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"BNMDBBJL7473","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BNMDBBJL7473NP7J","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BNMDBBJL","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BNMDBBJL7473NP7JXUBOVGSEJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.11217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-27T16:09:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fac1cf4dc89d4b63ea1cb72cf3c00dd338c9b7529885334175ab9f22bfda288b","abstract_canon_sha256":"3cd78f51fcd41b7af945477e09663f80846397b781c91b172efebc052836c535"},"schema_version":"1.0"},"canonical_sha256":"0b5830852bff3fb6bfe9bd02ea9a444e5a5f78856080b65fb7a2fea48ca66104","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.246133Z","signature_b64":"SUOpTxXSdxUWRejy5tYTrKhdQONFfeGRilRI5XC40jEI3CY6jUUjCIM+i/vxPwzfXSsJ5y+FakczomAiDj5CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b5830852bff3fb6bfe9bd02ea9a444e5a5f78856080b65fb7a2fea48ca66104","last_reissued_at":"2026-05-18T00:17:14.245664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.245664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.11217","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-18T00:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIfa5PRA0qyi7O78aBDr3GdmAIlc2d0Vw6UjRzZFowGVQcqkDdIxjbOJyP6J/VzD8PfEUNB8OE1Ith6EGjewBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:09:45.396144Z"},"content_sha256":"ca6ccdde84c299d538db28f207b43524f2a1c52b2438a8be1de85003118da2c1","schema_version":"1.0","event_id":"sha256:ca6ccdde84c299d538db28f207b43524f2a1c52b2438a8be1de85003118da2c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BNMDBBJL7473NP7JXUBOVGSEJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Letter graphs and geometric grid classes of permutations: characterization and recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bogdan Alecu, Dominique de Werra, Vadim Lozin, Viktor Zamaraev","submitted_at":"2018-04-27T16:09:29Z","abstract_excerpt":"In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a non-constructive way, a polynomial-time recognition of geometric grid classes of permutations and $k$-letter graphs for a fixed $k$. However, constructive algorithms are available only for $k=2$. In this paper, we present the first constructive polynomial-time algorithm for the recognition of $3$-letter graphs. It is based on a structural characterization of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11217","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-18T00:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DfZuOjmB0987dvobI40gQ3P35XtC8pgs+yRfNGecxdv9TGHe7GEYvShTug3mGBfwaeciMmSek+ivl3jTY1lPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:09:45.396558Z"},"content_sha256":"7f21b86a0795204911bc8b096765c2d3596668723d99be93ce227c8ec75d3f01","schema_version":"1.0","event_id":"sha256:7f21b86a0795204911bc8b096765c2d3596668723d99be93ce227c8ec75d3f01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNMDBBJL7473NP7JXUBOVGSEJZ/bundle.json","state_url":"https://pith.science/pith/BNMDBBJL7473NP7JXUBOVGSEJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNMDBBJL7473NP7JXUBOVGSEJZ/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-05-28T03:09:45Z","links":{"resolver":"https://pith.science/pith/BNMDBBJL7473NP7JXUBOVGSEJZ","bundle":"https://pith.science/pith/BNMDBBJL7473NP7JXUBOVGSEJZ/bundle.json","state":"https://pith.science/pith/BNMDBBJL7473NP7JXUBOVGSEJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNMDBBJL7473NP7JXUBOVGSEJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BNMDBBJL7473NP7JXUBOVGSEJZ","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":"3cd78f51fcd41b7af945477e09663f80846397b781c91b172efebc052836c535","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-27T16:09:29Z","title_canon_sha256":"fac1cf4dc89d4b63ea1cb72cf3c00dd338c9b7529885334175ab9f22bfda288b"},"schema_version":"1.0","source":{"id":"1804.11217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11217","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11217v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11217","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"BNMDBBJL7473","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BNMDBBJL7473NP7J","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BNMDBBJL","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:7f21b86a0795204911bc8b096765c2d3596668723d99be93ce227c8ec75d3f01","target":"graph","created_at":"2026-05-18T00:17:14Z","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":"In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a non-constructive way, a polynomial-time recognition of geometric grid classes of permutations and $k$-letter graphs for a fixed $k$. However, constructive algorithms are available only for $k=2$. In this paper, we present the first constructive polynomial-time algorithm for the recognition of $3$-letter graphs. It is based on a structural characterization of","authors_text":"Bogdan Alecu, Dominique de Werra, Vadim Lozin, Viktor Zamaraev","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-27T16:09:29Z","title":"Letter graphs and geometric grid classes of permutations: characterization and recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11217","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:ca6ccdde84c299d538db28f207b43524f2a1c52b2438a8be1de85003118da2c1","target":"record","created_at":"2026-05-18T00:17:14Z","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":"3cd78f51fcd41b7af945477e09663f80846397b781c91b172efebc052836c535","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-27T16:09:29Z","title_canon_sha256":"fac1cf4dc89d4b63ea1cb72cf3c00dd338c9b7529885334175ab9f22bfda288b"},"schema_version":"1.0","source":{"id":"1804.11217","kind":"arxiv","version":1}},"canonical_sha256":"0b5830852bff3fb6bfe9bd02ea9a444e5a5f78856080b65fb7a2fea48ca66104","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b5830852bff3fb6bfe9bd02ea9a444e5a5f78856080b65fb7a2fea48ca66104","first_computed_at":"2026-05-18T00:17:14.245664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:14.245664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUOpTxXSdxUWRejy5tYTrKhdQONFfeGRilRI5XC40jEI3CY6jUUjCIM+i/vxPwzfXSsJ5y+FakczomAiDj5CBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:14.246133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.11217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca6ccdde84c299d538db28f207b43524f2a1c52b2438a8be1de85003118da2c1","sha256:7f21b86a0795204911bc8b096765c2d3596668723d99be93ce227c8ec75d3f01"],"state_sha256":"1fb18cabcf81ff7deb84b750f0f39029f175726a1cbf31d36fb116ff826de470"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Px47i5seL94Z2AAkd7+FaqFjSp+C2ZfvV01aUROQgBz1G5mpHBkThH2EGnLcSnuC5Yd4ls9BVP7xlhNfOYUjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:09:45.398768Z","bundle_sha256":"f9ef58fb1527cb31be434027f95d3284e49790ae80a39dbe7bb894ec93548503"}}