{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VMW2FA5OTW5ZNW2LNUTV3FQQMD","short_pith_number":"pith:VMW2FA5O","canonical_record":{"source":{"id":"2501.10918","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:02:21Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"130dd149980705c17b19dd5e5487966a55c3d040879825742b7c1c3201e7e964","abstract_canon_sha256":"2691e324cc64b2cecf05b7012b4cfeffa1939611cf1acce7ba08bdb8296e4b64"},"schema_version":"1.0"},"canonical_sha256":"ab2da283ae9dbb96db4b6d275d961060efa695567260a67486f812ca28412095","source":{"kind":"arxiv","id":"2501.10918","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.10918","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"2501.10918v2","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10918","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"VMW2FA5OTW5Z","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"pith_short_16","alias_value":"VMW2FA5OTW5ZNW2L","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"pith_short_8","alias_value":"VMW2FA5O","created_at":"2026-06-02T01:03:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VMW2FA5OTW5ZNW2LNUTV3FQQMD","target":"record","payload":{"canonical_record":{"source":{"id":"2501.10918","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:02:21Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"130dd149980705c17b19dd5e5487966a55c3d040879825742b7c1c3201e7e964","abstract_canon_sha256":"2691e324cc64b2cecf05b7012b4cfeffa1939611cf1acce7ba08bdb8296e4b64"},"schema_version":"1.0"},"canonical_sha256":"ab2da283ae9dbb96db4b6d275d961060efa695567260a67486f812ca28412095","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:30.277153Z","signature_b64":"oA58okof9S9mJZH3A2txH6c4e5Md1hRMFUsnD3C54L3Xe3cua9APikC2EiN01Yj5BHKf2z0Gr9XAjh29WzAsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2da283ae9dbb96db4b6d275d961060efa695567260a67486f812ca28412095","last_reissued_at":"2026-06-02T01:03:30.276710Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:30.276710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.10918","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-06-02T01:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SDMppVJ35lGYr1p9mZwwILoHoEI2cWAZjyJb39NciIBcLJH2FFkBO4JuxKUNk+uLsi6ue1zC+4ss7aGGB32CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:41:37.965641Z"},"content_sha256":"849de4aee9dc9faf234237afbfcd2d0f43a283426128d07317f46295d4413c05","schema_version":"1.0","event_id":"sha256:849de4aee9dc9faf234237afbfcd2d0f43a283426128d07317f46295d4413c05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VMW2FA5OTW5ZNW2LNUTV3FQQMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Min-Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"math.CO","authors_text":"G\\'erard Cornu\\'ejols, R. Ravi, Siyue Liu","submitted_at":"2025-01-19T02:02:21Z","abstract_excerpt":"In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by Woodall remains open. We prove that the Edmonds-Giles conjecture is true if the underlying undirected graph is chordal. We also give a strongly polynomial-time algorithm to construct such a packing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10918","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/2501.10918/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-06-02T01:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wM4S7+xikBGmfEPRZCBcGjut46ZoF7S4SVuABzHS+p8A2saYxzOw0eKwYQcgiwoUaCHbrRAT0DnK0lJXz92UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:41:37.966398Z"},"content_sha256":"5b00f426e6d2f4af82837edc5d78f9056537a983b99d943d0a18c59709258b0a","schema_version":"1.0","event_id":"sha256:5b00f426e6d2f4af82837edc5d78f9056537a983b99d943d0a18c59709258b0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMW2FA5OTW5ZNW2LNUTV3FQQMD/bundle.json","state_url":"https://pith.science/pith/VMW2FA5OTW5ZNW2LNUTV3FQQMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMW2FA5OTW5ZNW2LNUTV3FQQMD/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-06-05T01:41:37Z","links":{"resolver":"https://pith.science/pith/VMW2FA5OTW5ZNW2LNUTV3FQQMD","bundle":"https://pith.science/pith/VMW2FA5OTW5ZNW2LNUTV3FQQMD/bundle.json","state":"https://pith.science/pith/VMW2FA5OTW5ZNW2LNUTV3FQQMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMW2FA5OTW5ZNW2LNUTV3FQQMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VMW2FA5OTW5ZNW2LNUTV3FQQMD","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":"2691e324cc64b2cecf05b7012b4cfeffa1939611cf1acce7ba08bdb8296e4b64","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:02:21Z","title_canon_sha256":"130dd149980705c17b19dd5e5487966a55c3d040879825742b7c1c3201e7e964"},"schema_version":"1.0","source":{"id":"2501.10918","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.10918","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"2501.10918v2","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10918","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"VMW2FA5OTW5Z","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"pith_short_16","alias_value":"VMW2FA5OTW5ZNW2L","created_at":"2026-06-02T01:03:30Z"},{"alias_kind":"pith_short_8","alias_value":"VMW2FA5O","created_at":"2026-06-02T01:03:30Z"}],"graph_snapshots":[{"event_id":"sha256:5b00f426e6d2f4af82837edc5d78f9056537a983b99d943d0a18c59709258b0a","target":"graph","created_at":"2026-06-02T01:03:30Z","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/2501.10918/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by Woodall remains open. We prove that the Edmonds-Giles conjecture is true if the underlying undirected graph is chordal. We also give a strongly polynomial-time algorithm to construct such a packing.","authors_text":"G\\'erard Cornu\\'ejols, R. Ravi, Siyue Liu","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:02:21Z","title":"A Min-Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10918","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:849de4aee9dc9faf234237afbfcd2d0f43a283426128d07317f46295d4413c05","target":"record","created_at":"2026-06-02T01:03:30Z","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":"2691e324cc64b2cecf05b7012b4cfeffa1939611cf1acce7ba08bdb8296e4b64","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T02:02:21Z","title_canon_sha256":"130dd149980705c17b19dd5e5487966a55c3d040879825742b7c1c3201e7e964"},"schema_version":"1.0","source":{"id":"2501.10918","kind":"arxiv","version":2}},"canonical_sha256":"ab2da283ae9dbb96db4b6d275d961060efa695567260a67486f812ca28412095","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab2da283ae9dbb96db4b6d275d961060efa695567260a67486f812ca28412095","first_computed_at":"2026-06-02T01:03:30.276710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:30.276710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oA58okof9S9mJZH3A2txH6c4e5Md1hRMFUsnD3C54L3Xe3cua9APikC2EiN01Yj5BHKf2z0Gr9XAjh29WzAsBA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:30.277153Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.10918","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:849de4aee9dc9faf234237afbfcd2d0f43a283426128d07317f46295d4413c05","sha256:5b00f426e6d2f4af82837edc5d78f9056537a983b99d943d0a18c59709258b0a"],"state_sha256":"160af78e8a2026856d00726f49465975ce263acdaa61e7a172ef95b0ac29e301"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"niBFZGaIjxUhkbLwGwm3izs/4I61Dtyrv55RkTG/LtZ3Ge2p/2eznlEaH62eOhIoga7NXRvBmRB1SjHz9oa+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:41:37.969855Z","bundle_sha256":"830c503e8f85558110402330b1731911e2e224971eebb0ddddf2dd8133862cd1"}}