{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QBZI6KX5A77YS3IZYGQRB3FDTW","short_pith_number":"pith:QBZI6KX5","schema_version":"1.0","canonical_sha256":"80728f2afd07ff896d19c1a110eca39d822459f3a250f3bf718e43660ef79a9f","source":{"kind":"arxiv","id":"1405.0456","version":1},"attestation_state":"computed","paper":{"title":"An LP-Rounding $2\\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Grandoni, Micha{\\l} W{\\l}odarczyk, Tomasz Kociumaka","submitted_at":"2014-05-02T17:18:53Z","abstract_excerpt":"In the classical Maximum Acyclic Subgraph problem (MAS), given a directed-edge weighted graph, we are required to find an ordering of the nodes that maximizes the total weight of forward-directed edges. MAS admits a 2 approximation, and this approximation is optimal under the Unique Game Conjecture.\n  In this paper we consider a generalization of MAS, the Restricted Maximum Acyclic Subgraph problem (RMAS), where each node is associated with a list of integer labels, and we have to find a labeling of the nodes so as to maximize the weight of edges whose head label is larger than the tail label."},"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":"1405.0456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-02T17:18:53Z","cross_cats_sorted":[],"title_canon_sha256":"ab6c063e013b508ac778d56f45fddaef37b29c6c80ff86ffa785891e153068b8","abstract_canon_sha256":"f59e80bba41348a9d53c759c18e2a5265eac6fb3dc5d3187cd68be7c27f0924a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.605991Z","signature_b64":"RDtH8MVTlEFLBxf9T2bL3+MIXTTe+UJwMEBQpebgGRUpjjHHtpWtZlFcFK2hHP2Pj+PkytciXm4mNgBaP+yVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80728f2afd07ff896d19c1a110eca39d822459f3a250f3bf718e43660ef79a9f","last_reissued_at":"2026-05-18T02:52:42.605555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.605555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An LP-Rounding $2\\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Grandoni, Micha{\\l} W{\\l}odarczyk, Tomasz Kociumaka","submitted_at":"2014-05-02T17:18:53Z","abstract_excerpt":"In the classical Maximum Acyclic Subgraph problem (MAS), given a directed-edge weighted graph, we are required to find an ordering of the nodes that maximizes the total weight of forward-directed edges. MAS admits a 2 approximation, and this approximation is optimal under the Unique Game Conjecture.\n  In this paper we consider a generalization of MAS, the Restricted Maximum Acyclic Subgraph problem (RMAS), where each node is associated with a list of integer labels, and we have to find a labeling of the nodes so as to maximize the weight of edges whose head label is larger than the tail label."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0456","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":"1405.0456","created_at":"2026-05-18T02:52:42.605620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0456v1","created_at":"2026-05-18T02:52:42.605620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0456","created_at":"2026-05-18T02:52:42.605620+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBZI6KX5A77Y","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBZI6KX5A77YS3IZ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBZI6KX5","created_at":"2026-05-18T12:28:43.426989+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/QBZI6KX5A77YS3IZYGQRB3FDTW","json":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW.json","graph_json":"https://pith.science/api/pith-number/QBZI6KX5A77YS3IZYGQRB3FDTW/graph.json","events_json":"https://pith.science/api/pith-number/QBZI6KX5A77YS3IZYGQRB3FDTW/events.json","paper":"https://pith.science/paper/QBZI6KX5"},"agent_actions":{"view_html":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW","download_json":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW.json","view_paper":"https://pith.science/paper/QBZI6KX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0456&json=true","fetch_graph":"https://pith.science/api/pith-number/QBZI6KX5A77YS3IZYGQRB3FDTW/graph.json","fetch_events":"https://pith.science/api/pith-number/QBZI6KX5A77YS3IZYGQRB3FDTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/action/storage_attestation","attest_author":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/action/author_attestation","sign_citation":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/action/citation_signature","submit_replication":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/action/replication_record"}},"created_at":"2026-05-18T02:52:42.605620+00:00","updated_at":"2026-05-18T02:52:42.605620+00:00"}