{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RVKGHCLZA7LOX7WNA2OXEQJ3MI","short_pith_number":"pith:RVKGHCLZ","schema_version":"1.0","canonical_sha256":"8d5463897907d6ebfecd069d72413b62294856fde0948641b6604332f5e586a7","source":{"kind":"arxiv","id":"1507.00662","version":1},"attestation_state":"computed","paper":{"title":"On the Approximability of Digraph Ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manish Purohit, Rishi Saket, Sreyash Kenkre, Vinayaka Pandit","submitted_at":"2015-07-02T17:17:06Z","abstract_excerpt":"Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling $\\ell : V \\to [k]$ maximizing the number of forward edges, i.e. edges (u,v) such that $\\ell$(u) < $\\ell$(v). For different values of k, this reduces to Maximum Acyclic Subgraph (k=n), and Max-Dicut (k=2). This work studies the approximability of Max-k-Ordering and its generalizations, motivated by their applications to job scheduling with soft precedence constraints. We give an LP rounding based 2-approximation algorithm for Max-k-Ordering for any k={2,..., n}, improving on the known 2k/(k-1)-approximation"},"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":"1507.00662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T17:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"454dac8918d59833f4d740d9ade43368ddda8c70f925ef55625e2c9712c9175e","abstract_canon_sha256":"6b0e7265856c5a82cce0df91c5980408e5bc450ecef5da575564c0ee5320b88f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:23.984118Z","signature_b64":"1InkvlChYZ3htherm5qT32dOU59DUagbTttBrmFHvrqOYK5S6wOxbZAtHSyO5pWMyqhGQwghgD+Xqk2WGsQCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d5463897907d6ebfecd069d72413b62294856fde0948641b6604332f5e586a7","last_reissued_at":"2026-05-18T01:37:23.983429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:23.983429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Approximability of Digraph Ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manish Purohit, Rishi Saket, Sreyash Kenkre, Vinayaka Pandit","submitted_at":"2015-07-02T17:17:06Z","abstract_excerpt":"Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling $\\ell : V \\to [k]$ maximizing the number of forward edges, i.e. edges (u,v) such that $\\ell$(u) < $\\ell$(v). For different values of k, this reduces to Maximum Acyclic Subgraph (k=n), and Max-Dicut (k=2). This work studies the approximability of Max-k-Ordering and its generalizations, motivated by their applications to job scheduling with soft precedence constraints. We give an LP rounding based 2-approximation algorithm for Max-k-Ordering for any k={2,..., n}, improving on the known 2k/(k-1)-approximation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00662","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":""},"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":"1507.00662","created_at":"2026-05-18T01:37:23.983534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00662v1","created_at":"2026-05-18T01:37:23.983534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00662","created_at":"2026-05-18T01:37:23.983534+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVKGHCLZA7LO","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVKGHCLZA7LOX7WN","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVKGHCLZ","created_at":"2026-05-18T12:29:39.896362+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/RVKGHCLZA7LOX7WNA2OXEQJ3MI","json":"https://pith.science/pith/RVKGHCLZA7LOX7WNA2OXEQJ3MI.json","graph_json":"https://pith.science/api/pith-number/RVKGHCLZA7LOX7WNA2OXEQJ3MI/graph.json","events_json":"https://pith.science/api/pith-number/RVKGHCLZA7LOX7WNA2OXEQJ3MI/events.json","paper":"https://pith.science/paper/RVKGHCLZ"},"agent_actions":{"view_html":"https://pith.science/pith/RVKGHCLZA7LOX7WNA2OXEQJ3MI","download_json":"https://pith.science/pith/RVKGHCLZA7LOX7WNA2OXEQJ3MI.json","view_paper":"https://pith.science/paper/RVKGHCLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00662&json=true","fetch_graph":"https://pith.science/api/pith-number/RVKGHCLZA7LOX7WNA2OXEQJ3MI/graph.json","fetch_events":"https://pith.science/api/pith-number/RVKGHCLZA7LOX7WNA2OXEQJ3MI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVKGHCLZA7LOX7WNA2OXEQJ3MI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVKGHCLZA7LOX7WNA2OXEQJ3MI/action/storage_attestation","attest_author":"https://pith.science/pith/RVKGHCLZA7LOX7WNA2OXEQJ3MI/action/author_attestation","sign_citation":"https://pith.science/pith/RVKGHCLZA7LOX7WNA2OXEQJ3MI/action/citation_signature","submit_replication":"https://pith.science/pith/RVKGHCLZA7LOX7WNA2OXEQJ3MI/action/replication_record"}},"created_at":"2026-05-18T01:37:23.983534+00:00","updated_at":"2026-05-18T01:37:23.983534+00:00"}