{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MUUQW2G6BP6T4K3LZPHODOQNOX","short_pith_number":"pith:MUUQW2G6","schema_version":"1.0","canonical_sha256":"65290b68de0bfd3e2b6bcbcee1ba0d75f546c7b9e14d74fe039771e1e182fbfc","source":{"kind":"arxiv","id":"1808.07600","version":3},"attestation_state":"computed","paper":{"title":"Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Frank, Kazuo Murota","submitted_at":"2018-08-23T00:45:48Z","abstract_excerpt":"Borradaile et al. (2017) investigated orientations of an undirected graph in which the sequence of in-degrees of the nodes is lexicographically minimal, which we call decreasingly minimal (=dec-min). They proved that an orientation is dec-min if and only if there is no dipath from $s$ to $t$ with in-degrees $\\varrho (t) \\geq \\varrho (s)+2$. They conjectured that an analogous statement holds for strongly connected dec-min orientations, as well. We prove not only this conjecture but its extension to $k$-edge-connected orientations, as well. We also provide a solution to a discrete version of Meg"},"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":"1808.07600","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-23T00:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"b6eb80210ada2260ddc076d07b3293ccd1035c64834998ea3a9c10e30b06da22","abstract_canon_sha256":"ff8a5f4abac9b68b79c72b931f8cba634b5a0a16d734a8eabf053a93ddbfeb6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:13.007517Z","signature_b64":"F8JLqCc5A7zglIv7wUVcRIlbcwepkXm5LNGsDw3xXWUs0cDRLx6guVSWqKGQ5r53lNkHTL/Aj0dv0FlzHF/kBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65290b68de0bfd3e2b6bcbcee1ba0d75f546c7b9e14d74fe039771e1e182fbfc","last_reissued_at":"2026-05-17T23:41:13.007074Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:13.007074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Frank, Kazuo Murota","submitted_at":"2018-08-23T00:45:48Z","abstract_excerpt":"Borradaile et al. (2017) investigated orientations of an undirected graph in which the sequence of in-degrees of the nodes is lexicographically minimal, which we call decreasingly minimal (=dec-min). They proved that an orientation is dec-min if and only if there is no dipath from $s$ to $t$ with in-degrees $\\varrho (t) \\geq \\varrho (s)+2$. They conjectured that an analogous statement holds for strongly connected dec-min orientations, as well. We prove not only this conjecture but its extension to $k$-edge-connected orientations, as well. We also provide a solution to a discrete version of Meg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07600","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1808.07600","created_at":"2026-05-17T23:41:13.007135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07600v3","created_at":"2026-05-17T23:41:13.007135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07600","created_at":"2026-05-17T23:41:13.007135+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUUQW2G6BP6T","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUUQW2G6BP6T4K3L","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUUQW2G6","created_at":"2026-05-18T12:32:40.477152+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/MUUQW2G6BP6T4K3LZPHODOQNOX","json":"https://pith.science/pith/MUUQW2G6BP6T4K3LZPHODOQNOX.json","graph_json":"https://pith.science/api/pith-number/MUUQW2G6BP6T4K3LZPHODOQNOX/graph.json","events_json":"https://pith.science/api/pith-number/MUUQW2G6BP6T4K3LZPHODOQNOX/events.json","paper":"https://pith.science/paper/MUUQW2G6"},"agent_actions":{"view_html":"https://pith.science/pith/MUUQW2G6BP6T4K3LZPHODOQNOX","download_json":"https://pith.science/pith/MUUQW2G6BP6T4K3LZPHODOQNOX.json","view_paper":"https://pith.science/paper/MUUQW2G6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07600&json=true","fetch_graph":"https://pith.science/api/pith-number/MUUQW2G6BP6T4K3LZPHODOQNOX/graph.json","fetch_events":"https://pith.science/api/pith-number/MUUQW2G6BP6T4K3LZPHODOQNOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUUQW2G6BP6T4K3LZPHODOQNOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUUQW2G6BP6T4K3LZPHODOQNOX/action/storage_attestation","attest_author":"https://pith.science/pith/MUUQW2G6BP6T4K3LZPHODOQNOX/action/author_attestation","sign_citation":"https://pith.science/pith/MUUQW2G6BP6T4K3LZPHODOQNOX/action/citation_signature","submit_replication":"https://pith.science/pith/MUUQW2G6BP6T4K3LZPHODOQNOX/action/replication_record"}},"created_at":"2026-05-17T23:41:13.007135+00:00","updated_at":"2026-05-17T23:41:13.007135+00:00"}