{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IIPPTMIJAXINJOQETBKLCO75LL","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":"1e5403f6167ade265e7f2b63707a19db934aa355d5183be5d084c93735a3f1fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-28T18:10:13Z","title_canon_sha256":"fb6d5b0a609ffbe1838f8abe6f53cfe0ea41c8de4318c8083c6c0fb1eb1a0d9f"},"schema_version":"1.0","source":{"id":"2502.21287","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.21287","created_at":"2026-07-05T10:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"2502.21287v2","created_at":"2026-07-05T10:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.21287","created_at":"2026-07-05T10:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"IIPPTMIJAXIN","created_at":"2026-07-05T10:43:44Z"},{"alias_kind":"pith_short_16","alias_value":"IIPPTMIJAXINJOQE","created_at":"2026-07-05T10:43:44Z"},{"alias_kind":"pith_short_8","alias_value":"IIPPTMIJ","created_at":"2026-07-05T10:43:44Z"}],"graph_snapshots":[{"event_id":"sha256:7cb62bd15ee9037f6cb6360f0337b3efdd697de246520c14814218f19830a311","target":"graph","created_at":"2026-07-05T10:43:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.21287/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1974, Erd\\H{o}s asked the following question: given a graph $G$ and a directed graph $\\vec{H}$, how many ways are there to orient the edges of $G$ such that it does not contain $\\vec{H}$ as a subgraph? We denote this value by $D(G, \\vec{H})$. Further, we let $D(n, \\vec{H})$ denote the maximum of $D(G, \\vec{H})$ over all graphs $G$ on $n$ vertices. In 2006, Alon and Yuster gave an exact answer when $\\vec{H}$ is a tournament. In 2023, Buci\\'c, Janzer, and Sudakov gave asymptotic answers for all directed graphs $\\vec{H}$, and in the same paper, they gave an exact answer when $\\vec{H}$ is a dir","authors_text":"Hannah Sheats","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-28T18:10:13Z","title":"Orientations of graphs omitting non-edge-critical directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.21287","kind":"arxiv","version":2},"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:5b0b67ff752052aba09d94956a5892358409f95f70473039d0db1971e350b27b","target":"record","created_at":"2026-07-05T10:43:44Z","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":"1e5403f6167ade265e7f2b63707a19db934aa355d5183be5d084c93735a3f1fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-28T18:10:13Z","title_canon_sha256":"fb6d5b0a609ffbe1838f8abe6f53cfe0ea41c8de4318c8083c6c0fb1eb1a0d9f"},"schema_version":"1.0","source":{"id":"2502.21287","kind":"arxiv","version":2}},"canonical_sha256":"421ef9b10905d0d4ba049854b13bfd5ae26046023e85ca4af921bdc9fc4fb600","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"421ef9b10905d0d4ba049854b13bfd5ae26046023e85ca4af921bdc9fc4fb600","first_computed_at":"2026-07-05T10:43:44.467430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:44.467430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tiBdK2erb1BKQ86A25ATJzdD4Fizw6z9SPlC/pzIquh2w4Cr5l2/6DMsqQAQ3g+n60ImfGiH8YUzhQsMbgeIAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:44.467863Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.21287","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b0b67ff752052aba09d94956a5892358409f95f70473039d0db1971e350b27b","sha256:7cb62bd15ee9037f6cb6360f0337b3efdd697de246520c14814218f19830a311"],"state_sha256":"35ea13f779b3e1beda87f2a0cabc0b714dab86aac875c1eced059d190efc3bfc"}