{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NNX6FRHN22VM2SLPHAZNTZ5GJR","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":"463b2bd0eb91c966c6ae5a0464cc40b715f056c6963b9a27ee546c3ac7e5a759","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-02T09:51:54Z","title_canon_sha256":"3beb66278feb38bd7c834eeefd0d25e8082e49fd3dd8adc3c97c2f31339b4426"},"schema_version":"1.0","source":{"id":"2510.01852","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.01852","created_at":"2026-06-01T01:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"2510.01852v5","created_at":"2026-06-01T01:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.01852","created_at":"2026-06-01T01:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"NNX6FRHN22VM","created_at":"2026-06-01T01:02:22Z"},{"alias_kind":"pith_short_16","alias_value":"NNX6FRHN22VM2SLP","created_at":"2026-06-01T01:02:22Z"},{"alias_kind":"pith_short_8","alias_value":"NNX6FRHN","created_at":"2026-06-01T01:02:22Z"}],"graph_snapshots":[{"event_id":"sha256:9e1d1d81011b15345796f42bdda9ae28d2203f4640a56b6715de3c9a2b792c72","target":"graph","created_at":"2026-06-01T01:02:22Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We will establish a general framework, which enables us to answer these problems for a wide class of combinatorial structures, including graphs, digraphs and collections of relations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the consecutive embedding order on the structures permits the extension of recent approaches into a single general framework that covers the stated wide class without additional restrictions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Establishes a general framework to answer decidability questions on well quasi-order and atomicity for avoidance sets in posets of combinatorial structures under consecutive orders, covering graphs, digraphs and relations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A general framework decides well quasi-order and atomicity for avoidance sets of combinatorial structures under consecutive orders."}],"snapshot_sha256":"1f34b7a27131989a17aa2e3c00a6a79ab6f23f0d2f15ec0a442de760090d5865"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.01852/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a partially ordered set, we may ask decidability questions about its avoidance sets: subsets defined by a finite number of forbidden substructures. Two such questions ask, given a finite set of structures, whether its avoidance set is well quasi-ordered (i.e. contains no infinite antichains) or atomic (i.e. cannot be expressed as the union of two proper subsets).","authors_text":"Nik Ru\\v{s}kuc, Victoria Ironmonger","cross_cats":[],"headline":"A general framework decides well quasi-order and atomicity for avoidance sets of combinatorial structures under consecutive orders.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-02T09:51:54Z","title":"Well quasi-order and atomicity for combinatorial structures under consecutive orders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.01852","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-18T10:48:28.366621Z","id":"3aa790a1-e52a-418c-b93b-abf4af7f335f","model_set":{"reader":"grok-4.3"},"one_line_summary":"Establishes a general framework to answer decidability questions on well quasi-order and atomicity for avoidance sets in posets of combinatorial structures under consecutive orders, covering graphs, digraphs and relations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A general framework decides well quasi-order and atomicity for avoidance sets of combinatorial structures under consecutive orders.","strongest_claim":"We will establish a general framework, which enables us to answer these problems for a wide class of combinatorial structures, including graphs, digraphs and collections of relations.","weakest_assumption":"That the consecutive embedding order on the structures permits the extension of recent approaches into a single general framework that covers the stated wide class without additional restrictions."}},"verdict_id":"3aa790a1-e52a-418c-b93b-abf4af7f335f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b639633e4ab93a3b2805acf6a4b601beaaf183a614ef5b245bb0c63ddb8e4070","target":"record","created_at":"2026-06-01T01:02:22Z","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":"463b2bd0eb91c966c6ae5a0464cc40b715f056c6963b9a27ee546c3ac7e5a759","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-02T09:51:54Z","title_canon_sha256":"3beb66278feb38bd7c834eeefd0d25e8082e49fd3dd8adc3c97c2f31339b4426"},"schema_version":"1.0","source":{"id":"2510.01852","kind":"arxiv","version":5}},"canonical_sha256":"6b6fe2c4edd6aacd496f3832d9e7a64c69b17f3d664f00cbe44880a7b8079ceb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b6fe2c4edd6aacd496f3832d9e7a64c69b17f3d664f00cbe44880a7b8079ceb","first_computed_at":"2026-06-01T01:02:22.242186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:02:22.242186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yGR97XLfWmxn8/pO5Ql2ELeAEI0CbJ7pG/1kTvjxV2ri/HXuaaR4RTbrENb49I5iT4SKJCHxv3nh/UhxLY+7BA==","signature_status":"signed_v1","signed_at":"2026-06-01T01:02:22.243018Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.01852","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b639633e4ab93a3b2805acf6a4b601beaaf183a614ef5b245bb0c63ddb8e4070","sha256:9e1d1d81011b15345796f42bdda9ae28d2203f4640a56b6715de3c9a2b792c72"],"state_sha256":"f63ebfdcd54abed57955ed64f2a86df301022a617af551db331c186bff719048"}