{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:IKZMOHPSNR4QR4EVUVARU4LHIP","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":"95e024d3caa94bf193b52a9c472d413604c22d76916f5c109dd5c9574324d27f","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-02-06T16:02:48Z","title_canon_sha256":"1ebf67a28eb678abd68c94475ffc0bb56bdb15e4f2111a1213bf4308ddbd34e0"},"schema_version":"1.0","source":{"id":"math/0702147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0702147","created_at":"2026-05-18T03:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"math/0702147v1","created_at":"2026-05-18T03:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0702147","created_at":"2026-05-18T03:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"IKZMOHPSNR4Q","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"IKZMOHPSNR4QR4EV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"IKZMOHPS","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:d61dbd621c8c19f97e6b4533cc2f13cf3c3d7dc329b14fa8c85362ba6374d734","target":"graph","created_at":"2026-05-18T03:41: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"},"paper":{"abstract_excerpt":"Let G be a digraph (without parallel edges) such that every directed cycle has length at least four; let $\\beta(G)$ denote the size of the smallest subset X in E(G) such that $G\\X$ has no directed cycles, and let $\\gamma(G)$ be the number of unordered pairs {u,v} of vertices such that u,v are nonadjacent in G. It is easy to see that if $\\gamma(G) = 0$ then $\\beta(G) = 0$; what can we say about $\\beta(G)$ if $\\gamma(G)$ is bounded?\n  We prove that in general $\\beta(G)$ is at most $\\gamma(G)$. We conjecture that in fact $\\beta(G)$ is at most $\\gamma(G)/2$ (this would be best possible if true), a","authors_text":"Blair D. Sullivan, Maria Chudnovsky, Paul Seymour","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-02-06T16:02:48Z","title":"Cycles in dense digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0702147","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:9db2bc553e3f9b9f06132538b4682c9140d1bf585aa8db379d50ebe5fa7e4b5a","target":"record","created_at":"2026-05-18T03:41: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":"95e024d3caa94bf193b52a9c472d413604c22d76916f5c109dd5c9574324d27f","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2007-02-06T16:02:48Z","title_canon_sha256":"1ebf67a28eb678abd68c94475ffc0bb56bdb15e4f2111a1213bf4308ddbd34e0"},"schema_version":"1.0","source":{"id":"math/0702147","kind":"arxiv","version":1}},"canonical_sha256":"42b2c71df26c7908f095a5411a716743fdac17167a411d6795da1eb5429eea12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42b2c71df26c7908f095a5411a716743fdac17167a411d6795da1eb5429eea12","first_computed_at":"2026-05-18T03:41:44.364710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:44.364710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"56aob3pCXtGUlO18J//kUK78DM9U6wNh5P9AgjdNWCEkc5Pjv10bMwEivlhWVz8wBl/xqajsDzVrz9VnYvamDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:44.365577Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0702147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9db2bc553e3f9b9f06132538b4682c9140d1bf585aa8db379d50ebe5fa7e4b5a","sha256:d61dbd621c8c19f97e6b4533cc2f13cf3c3d7dc329b14fa8c85362ba6374d734"],"state_sha256":"adf4716a216cea460db68af0c4f109c94124ed3559f79fa573c2fd6fdcbdbb19"}