{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Y6TBLBLR2FE2RGNPMHVVZJOOYS","short_pith_number":"pith:Y6TBLBLR","schema_version":"1.0","canonical_sha256":"c7a6158571d149a899af61eb5ca5cec496ca3cf26acb510d0c728264e53ef916","source":{"kind":"arxiv","id":"2411.13202","version":1},"attestation_state":"computed","paper":{"title":"Strong orientation of a connected graph for a crossing family","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ahmad Abdi, Mahsa Dalirrooyfard, Meike Neuwohner","submitted_at":"2024-11-20T11:04:48Z","abstract_excerpt":"Given a connected graph $G=(V,E)$ and a crossing family $\\mathcal{C}$ over ground set $V$ such that $|\\delta_G(U)|\\geq 2$ for every $U\\in \\mathcal{C}$, we prove there exists a strong orientation of $G$ for $\\mathcal{C}$, i.e., an orientation of $G$ such that each set in $\\mathcal{C}$ has at least one outgoing and at least one incoming arc. This implies the main conjecture in Chudnovsky et al. (Disjoint dijoins. Journal of Combinatorial Theory, Series B, 120:18--35, 2016). In particular, in every minimal counterexample to the Edmonds-Giles conjecture where the minimum weight of a dicut is $2$, "},"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":"2411.13202","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T11:04:48Z","cross_cats_sorted":[],"title_canon_sha256":"15dd13282989da013bb6d99e3d08f5493a379be0688d4881a2ef8008141e85f0","abstract_canon_sha256":"ac563243fc40e5782e7e816941b1c533cbb981e6043e9cd2d2e283e50670d35a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:06.634701Z","signature_b64":"mFa0O5uLEgOzkoQTSZY6042glZ7VEfPtjF5t9E9gPzUYbEhKZ5inMSHcI9QzOPoz7ivk7R0FXVNUkXsqbZqTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7a6158571d149a899af61eb5ca5cec496ca3cf26acb510d0c728264e53ef916","last_reissued_at":"2026-07-05T09:38:06.634288Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:06.634288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong orientation of a connected graph for a crossing family","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ahmad Abdi, Mahsa Dalirrooyfard, Meike Neuwohner","submitted_at":"2024-11-20T11:04:48Z","abstract_excerpt":"Given a connected graph $G=(V,E)$ and a crossing family $\\mathcal{C}$ over ground set $V$ such that $|\\delta_G(U)|\\geq 2$ for every $U\\in \\mathcal{C}$, we prove there exists a strong orientation of $G$ for $\\mathcal{C}$, i.e., an orientation of $G$ such that each set in $\\mathcal{C}$ has at least one outgoing and at least one incoming arc. This implies the main conjecture in Chudnovsky et al. (Disjoint dijoins. Journal of Combinatorial Theory, Series B, 120:18--35, 2016). In particular, in every minimal counterexample to the Edmonds-Giles conjecture where the minimum weight of a dicut is $2$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13202","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.13202/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":"2411.13202","created_at":"2026-07-05T09:38:06.634359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13202v1","created_at":"2026-07-05T09:38:06.634359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13202","created_at":"2026-07-05T09:38:06.634359+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6TBLBLR2FE2","created_at":"2026-07-05T09:38:06.634359+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6TBLBLR2FE2RGNP","created_at":"2026-07-05T09:38:06.634359+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6TBLBLR","created_at":"2026-07-05T09:38:06.634359+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/Y6TBLBLR2FE2RGNPMHVVZJOOYS","json":"https://pith.science/pith/Y6TBLBLR2FE2RGNPMHVVZJOOYS.json","graph_json":"https://pith.science/api/pith-number/Y6TBLBLR2FE2RGNPMHVVZJOOYS/graph.json","events_json":"https://pith.science/api/pith-number/Y6TBLBLR2FE2RGNPMHVVZJOOYS/events.json","paper":"https://pith.science/paper/Y6TBLBLR"},"agent_actions":{"view_html":"https://pith.science/pith/Y6TBLBLR2FE2RGNPMHVVZJOOYS","download_json":"https://pith.science/pith/Y6TBLBLR2FE2RGNPMHVVZJOOYS.json","view_paper":"https://pith.science/paper/Y6TBLBLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13202&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6TBLBLR2FE2RGNPMHVVZJOOYS/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6TBLBLR2FE2RGNPMHVVZJOOYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6TBLBLR2FE2RGNPMHVVZJOOYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6TBLBLR2FE2RGNPMHVVZJOOYS/action/storage_attestation","attest_author":"https://pith.science/pith/Y6TBLBLR2FE2RGNPMHVVZJOOYS/action/author_attestation","sign_citation":"https://pith.science/pith/Y6TBLBLR2FE2RGNPMHVVZJOOYS/action/citation_signature","submit_replication":"https://pith.science/pith/Y6TBLBLR2FE2RGNPMHVVZJOOYS/action/replication_record"}},"created_at":"2026-07-05T09:38:06.634359+00:00","updated_at":"2026-07-05T09:38:06.634359+00:00"}