{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IZCYVQRAUSVTYNPGJEUDZSQE7W","short_pith_number":"pith:IZCYVQRA","schema_version":"1.0","canonical_sha256":"46458ac220a4ab3c35e649283cca04fdba58c675de90cb2c304dde94c3a065d8","source":{"kind":"arxiv","id":"1408.1461","version":1},"attestation_state":"computed","paper":{"title":"Ordering without forbidden patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Arash Rafiey, Bojan Mohar, Pavol Hell","submitted_at":"2014-08-07T01:57:54Z","abstract_excerpt":"Let F be a set of ordered patterns, i.e., graphs whose vertices are linearly ordered. An F-free ordering of the vertices of a graph H is a linear ordering of V(H) such that none of patterns in F occurs as an induced ordered subgraph. We denote by ORD(F) the decision problem asking whether an input graph admits an F-free ordering; we also use ORD(F) to denote the class of graphs that do admit an F-free ordering. It was observed by Damaschke (and others) that many natural graph classes can be described as ORD(F) for sets F of small patterns (with three or four vertices). Damaschke also noted tha"},"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":"1408.1461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-07T01:57:54Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"f63b81a9595378433312e178c6af037125c8c214895d9aa3472c167661236ceb","abstract_canon_sha256":"084714da15056f4507b5936e839adc6cc146e2a816586a800adc1f07341dc1e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:40.434479Z","signature_b64":"26OwZ+cu6ANK9vgso2BxhjzOQxnWXBgSSy0bmU4YFNCiHbojKx08UkSC+03hkDLm2BzW89IaFwJzOqX5dAIYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46458ac220a4ab3c35e649283cca04fdba58c675de90cb2c304dde94c3a065d8","last_reissued_at":"2026-05-18T02:45:40.433975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:40.433975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordering without forbidden patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Arash Rafiey, Bojan Mohar, Pavol Hell","submitted_at":"2014-08-07T01:57:54Z","abstract_excerpt":"Let F be a set of ordered patterns, i.e., graphs whose vertices are linearly ordered. An F-free ordering of the vertices of a graph H is a linear ordering of V(H) such that none of patterns in F occurs as an induced ordered subgraph. We denote by ORD(F) the decision problem asking whether an input graph admits an F-free ordering; we also use ORD(F) to denote the class of graphs that do admit an F-free ordering. It was observed by Damaschke (and others) that many natural graph classes can be described as ORD(F) for sets F of small patterns (with three or four vertices). Damaschke also noted tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1461","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":"1408.1461","created_at":"2026-05-18T02:45:40.434063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1461v1","created_at":"2026-05-18T02:45:40.434063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1461","created_at":"2026-05-18T02:45:40.434063+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZCYVQRAUSVT","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZCYVQRAUSVTYNPG","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZCYVQRA","created_at":"2026-05-18T12:28:33.132498+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/IZCYVQRAUSVTYNPGJEUDZSQE7W","json":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W.json","graph_json":"https://pith.science/api/pith-number/IZCYVQRAUSVTYNPGJEUDZSQE7W/graph.json","events_json":"https://pith.science/api/pith-number/IZCYVQRAUSVTYNPGJEUDZSQE7W/events.json","paper":"https://pith.science/paper/IZCYVQRA"},"agent_actions":{"view_html":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W","download_json":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W.json","view_paper":"https://pith.science/paper/IZCYVQRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1461&json=true","fetch_graph":"https://pith.science/api/pith-number/IZCYVQRAUSVTYNPGJEUDZSQE7W/graph.json","fetch_events":"https://pith.science/api/pith-number/IZCYVQRAUSVTYNPGJEUDZSQE7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/action/storage_attestation","attest_author":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/action/author_attestation","sign_citation":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/action/citation_signature","submit_replication":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/action/replication_record"}},"created_at":"2026-05-18T02:45:40.434063+00:00","updated_at":"2026-05-18T02:45:40.434063+00:00"}