{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IIPPTMIJAXINJOQETBKLCO75LL","short_pith_number":"pith:IIPPTMIJ","schema_version":"1.0","canonical_sha256":"421ef9b10905d0d4ba049854b13bfd5ae26046023e85ca4af921bdc9fc4fb600","source":{"kind":"arxiv","id":"2502.21287","version":2},"attestation_state":"computed","paper":{"title":"Orientations of graphs omitting non-edge-critical directed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hannah Sheats","submitted_at":"2025-02-28T18:10:13Z","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"},"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":"2502.21287","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-28T18:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"fb6d5b0a609ffbe1838f8abe6f53cfe0ea41c8de4318c8083c6c0fb1eb1a0d9f","abstract_canon_sha256":"1e5403f6167ade265e7f2b63707a19db934aa355d5183be5d084c93735a3f1fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:44.467863Z","signature_b64":"tiBdK2erb1BKQ86A25ATJzdD4Fizw6z9SPlC/pzIquh2w4Cr5l2/6DMsqQAQ3g+n60ImfGiH8YUzhQsMbgeIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"421ef9b10905d0d4ba049854b13bfd5ae26046023e85ca4af921bdc9fc4fb600","last_reissued_at":"2026-07-05T10:43:44.467430Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:44.467430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orientations of graphs omitting non-edge-critical directed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hannah Sheats","submitted_at":"2025-02-28T18:10:13Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.21287","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.21287/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.21287","created_at":"2026-07-05T10:43:44.467486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.21287v2","created_at":"2026-07-05T10:43:44.467486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.21287","created_at":"2026-07-05T10:43:44.467486+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIPPTMIJAXIN","created_at":"2026-07-05T10:43:44.467486+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIPPTMIJAXINJOQE","created_at":"2026-07-05T10:43:44.467486+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIPPTMIJ","created_at":"2026-07-05T10:43:44.467486+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/IIPPTMIJAXINJOQETBKLCO75LL","json":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL.json","graph_json":"https://pith.science/api/pith-number/IIPPTMIJAXINJOQETBKLCO75LL/graph.json","events_json":"https://pith.science/api/pith-number/IIPPTMIJAXINJOQETBKLCO75LL/events.json","paper":"https://pith.science/paper/IIPPTMIJ"},"agent_actions":{"view_html":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL","download_json":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL.json","view_paper":"https://pith.science/paper/IIPPTMIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.21287&json=true","fetch_graph":"https://pith.science/api/pith-number/IIPPTMIJAXINJOQETBKLCO75LL/graph.json","fetch_events":"https://pith.science/api/pith-number/IIPPTMIJAXINJOQETBKLCO75LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/action/storage_attestation","attest_author":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/action/author_attestation","sign_citation":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/action/citation_signature","submit_replication":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/action/replication_record"}},"created_at":"2026-07-05T10:43:44.467486+00:00","updated_at":"2026-07-05T10:43:44.467486+00:00"}