{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IZCYVQRAUSVTYNPGJEUDZSQE7W","short_pith_number":"pith:IZCYVQRA","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"},"canonical_sha256":"46458ac220a4ab3c35e649283cca04fdba58c675de90cb2c304dde94c3a065d8","source":{"kind":"arxiv","id":"1408.1461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1461","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1461v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1461","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"IZCYVQRAUSVT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IZCYVQRAUSVTYNPG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IZCYVQRA","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IZCYVQRAUSVTYNPGJEUDZSQE7W","target":"record","payload":{"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"},"canonical_sha256":"46458ac220a4ab3c35e649283cca04fdba58c675de90cb2c304dde94c3a065d8","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"},"source_kind":"arxiv","source_id":"1408.1461","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-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pJKksz/QNBG9CrGFCob3lYqLQyPxzgvxvTuOAWOryEvfR1BTVqFqeJec9NK6teBNwCEpI65Vpo8pP1oPpnmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:47:59.697191Z"},"content_sha256":"1e2c742c6a87e87d5abfb518a9f564c3f26efb74f210ad379f358dd4e77bc373","schema_version":"1.0","event_id":"sha256:1e2c742c6a87e87d5abfb518a9f564c3f26efb74f210ad379f358dd4e77bc373"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IZCYVQRAUSVTYNPGJEUDZSQE7W","target":"graph","payload":{"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"},"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-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzY7XOfF3KNuxbWM8y+PsQwNsAKpCFWOMzFMj9tWbVJfWCQnQaRDRprnfEZVb8xLHXx9KvNEGL0ntCiqxWW5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:47:59.697565Z"},"content_sha256":"6138df5091bcdd0a3a78e3b27337d36ab38ac0540398b2c48b1fbd8d203ea48f","schema_version":"1.0","event_id":"sha256:6138df5091bcdd0a3a78e3b27337d36ab38ac0540398b2c48b1fbd8d203ea48f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/bundle.json","state_url":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/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-01T12:47:59Z","links":{"resolver":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W","bundle":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/bundle.json","state":"https://pith.science/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZCYVQRAUSVTYNPGJEUDZSQE7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IZCYVQRAUSVTYNPGJEUDZSQE7W","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":"084714da15056f4507b5936e839adc6cc146e2a816586a800adc1f07341dc1e6","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-07T01:57:54Z","title_canon_sha256":"f63b81a9595378433312e178c6af037125c8c214895d9aa3472c167661236ceb"},"schema_version":"1.0","source":{"id":"1408.1461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1461","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1461v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1461","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"IZCYVQRAUSVT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IZCYVQRAUSVTYNPG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IZCYVQRA","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:6138df5091bcdd0a3a78e3b27337d36ab38ac0540398b2c48b1fbd8d203ea48f","target":"graph","created_at":"2026-05-18T02:45:40Z","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 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","authors_text":"Arash Rafiey, Bojan Mohar, Pavol Hell","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-07T01:57:54Z","title":"Ordering without forbidden patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1461","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:1e2c742c6a87e87d5abfb518a9f564c3f26efb74f210ad379f358dd4e77bc373","target":"record","created_at":"2026-05-18T02:45:40Z","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":"084714da15056f4507b5936e839adc6cc146e2a816586a800adc1f07341dc1e6","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-07T01:57:54Z","title_canon_sha256":"f63b81a9595378433312e178c6af037125c8c214895d9aa3472c167661236ceb"},"schema_version":"1.0","source":{"id":"1408.1461","kind":"arxiv","version":1}},"canonical_sha256":"46458ac220a4ab3c35e649283cca04fdba58c675de90cb2c304dde94c3a065d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46458ac220a4ab3c35e649283cca04fdba58c675de90cb2c304dde94c3a065d8","first_computed_at":"2026-05-18T02:45:40.433975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:40.433975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"26OwZ+cu6ANK9vgso2BxhjzOQxnWXBgSSy0bmU4YFNCiHbojKx08UkSC+03hkDLm2BzW89IaFwJzOqX5dAIYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:40.434479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e2c742c6a87e87d5abfb518a9f564c3f26efb74f210ad379f358dd4e77bc373","sha256:6138df5091bcdd0a3a78e3b27337d36ab38ac0540398b2c48b1fbd8d203ea48f"],"state_sha256":"c52507a801b603b11ab3890835c17cd9c3b4d206e474a7e7f5ab27e8dca3faa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8BVDmf9olC7ChChTKa3gI1RfbTqofGjX4X1QfPe8CHKM23bRfy+0xqc5SelqMoTsAVp1i8kkXneO/eySnmQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:47:59.699521Z","bundle_sha256":"11992461822333fd76898b33a926353bdb2e1e74ee119ca4a6562cf42d107a92"}}