{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IIPPTMIJAXINJOQETBKLCO75LL","short_pith_number":"pith:IIPPTMIJ","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"},"canonical_sha256":"421ef9b10905d0d4ba049854b13bfd5ae26046023e85ca4af921bdc9fc4fb600","source":{"kind":"arxiv","id":"2502.21287","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IIPPTMIJAXINJOQETBKLCO75LL","target":"record","payload":{"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"},"canonical_sha256":"421ef9b10905d0d4ba049854b13bfd5ae26046023e85ca4af921bdc9fc4fb600","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"},"source_kind":"arxiv","source_id":"2502.21287","source_version":2,"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-07-05T10:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUK6IBAcG+FBhjL+Wpb63NTQ7LZ13sCS6UxywlGk0B1bifoMJcJ4l/TFgs4bwnsjMQrQAbiB/o4ZTd1GRztACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:19:48.770407Z"},"content_sha256":"5b0b67ff752052aba09d94956a5892358409f95f70473039d0db1971e350b27b","schema_version":"1.0","event_id":"sha256:5b0b67ff752052aba09d94956a5892358409f95f70473039d0db1971e350b27b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IIPPTMIJAXINJOQETBKLCO75LL","target":"graph","payload":{"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"},"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-07-05T10:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RkQiOZlhix9IGwi+9BJUnGK/I1wtPfNSCzjVIL9wbIIIFTVrqfMTo5Vl/9yFimtEgUdCRIMg+TFlZRconwPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:19:48.770776Z"},"content_sha256":"7cb62bd15ee9037f6cb6360f0337b3efdd697de246520c14814218f19830a311","schema_version":"1.0","event_id":"sha256:7cb62bd15ee9037f6cb6360f0337b3efdd697de246520c14814218f19830a311"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/bundle.json","state_url":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIPPTMIJAXINJOQETBKLCO75LL/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-07-07T10:19:48Z","links":{"resolver":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL","bundle":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/bundle.json","state":"https://pith.science/pith/IIPPTMIJAXINJOQETBKLCO75LL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIPPTMIJAXINJOQETBKLCO75LL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrwNUZUO9pEDRk1ZOmL2DpbIUZlm7VFhbOKo/Y+5lpzNdOqvUHwdtf0pxpzb3ypajEWqOzigD3TbR9vOXbi8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:19:48.772728Z","bundle_sha256":"d0a2775ec89a19a572982175732675b4ea4cb71c71cd8b7618551be19ff84185"}}