{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:2TWZ62I7CPZQVLHEL2GHRZW4Z4","short_pith_number":"pith:2TWZ62I7","schema_version":"1.0","canonical_sha256":"d4ed9f691f13f30aace45e8c78e6dccf11960cb6b8ce3fcd9489ac13a1dab325","source":{"kind":"arxiv","id":"cs/0607082","version":1},"attestation_state":"computed","paper":{"title":"Well quasi-orders and the shuffle closure of finite sets","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Flavio D'Alessandro, Gw\\'ena\\\"el Richomme (LaRIA), Stefano Varrichio","submitted_at":"2006-07-18T05:30:52Z","abstract_excerpt":"Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the problem of the characterization of the finite sets I such that the order is a well quasi-order . In this paper we give an answer in the case when I consists of a single word w."},"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":"cs/0607082","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2006-07-18T05:30:52Z","cross_cats_sorted":[],"title_canon_sha256":"e40ccfb47a2e1ccd0595f575a24480455476fdf6ac8b9db8859644ad7b329f88","abstract_canon_sha256":"fd377c992d96a13a1c6f271b9fb98f55026a590c4383d9fb1ea2df3e57eeb026"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:54.562080Z","signature_b64":"ilxHE9TOsMla+llIY52JIp07YhJ4lZygU++gE9MhSLOzCQ1IuAVfsRrD9/DeOGwQKeRS+ZdPRkU4bLr4Hi0nBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4ed9f691f13f30aace45e8c78e6dccf11960cb6b8ce3fcd9489ac13a1dab325","last_reissued_at":"2026-05-18T01:08:54.561440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:54.561440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Well quasi-orders and the shuffle closure of finite sets","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Flavio D'Alessandro, Gw\\'ena\\\"el Richomme (LaRIA), Stefano Varrichio","submitted_at":"2006-07-18T05:30:52Z","abstract_excerpt":"Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the problem of the characterization of the finite sets I such that the order is a well quasi-order . In this paper we give an answer in the case when I consists of a single word w."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0607082","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":"cs/0607082","created_at":"2026-05-18T01:08:54.561543+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0607082v1","created_at":"2026-05-18T01:08:54.561543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0607082","created_at":"2026-05-18T01:08:54.561543+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TWZ62I7CPZQ","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TWZ62I7CPZQVLHE","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TWZ62I7","created_at":"2026-05-18T12:25:53.939244+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/2TWZ62I7CPZQVLHEL2GHRZW4Z4","json":"https://pith.science/pith/2TWZ62I7CPZQVLHEL2GHRZW4Z4.json","graph_json":"https://pith.science/api/pith-number/2TWZ62I7CPZQVLHEL2GHRZW4Z4/graph.json","events_json":"https://pith.science/api/pith-number/2TWZ62I7CPZQVLHEL2GHRZW4Z4/events.json","paper":"https://pith.science/paper/2TWZ62I7"},"agent_actions":{"view_html":"https://pith.science/pith/2TWZ62I7CPZQVLHEL2GHRZW4Z4","download_json":"https://pith.science/pith/2TWZ62I7CPZQVLHEL2GHRZW4Z4.json","view_paper":"https://pith.science/paper/2TWZ62I7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0607082&json=true","fetch_graph":"https://pith.science/api/pith-number/2TWZ62I7CPZQVLHEL2GHRZW4Z4/graph.json","fetch_events":"https://pith.science/api/pith-number/2TWZ62I7CPZQVLHEL2GHRZW4Z4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TWZ62I7CPZQVLHEL2GHRZW4Z4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TWZ62I7CPZQVLHEL2GHRZW4Z4/action/storage_attestation","attest_author":"https://pith.science/pith/2TWZ62I7CPZQVLHEL2GHRZW4Z4/action/author_attestation","sign_citation":"https://pith.science/pith/2TWZ62I7CPZQVLHEL2GHRZW4Z4/action/citation_signature","submit_replication":"https://pith.science/pith/2TWZ62I7CPZQVLHEL2GHRZW4Z4/action/replication_record"}},"created_at":"2026-05-18T01:08:54.561543+00:00","updated_at":"2026-05-18T01:08:54.561543+00:00"}