{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QBZI6KX5A77YS3IZYGQRB3FDTW","short_pith_number":"pith:QBZI6KX5","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"},"canonical_sha256":"80728f2afd07ff896d19c1a110eca39d822459f3a250f3bf718e43660ef79a9f","source":{"kind":"arxiv","id":"1405.0456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0456","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0456v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0456","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"QBZI6KX5A77Y","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QBZI6KX5A77YS3IZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QBZI6KX5","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QBZI6KX5A77YS3IZYGQRB3FDTW","target":"record","payload":{"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"},"canonical_sha256":"80728f2afd07ff896d19c1a110eca39d822459f3a250f3bf718e43660ef79a9f","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"},"source_kind":"arxiv","source_id":"1405.0456","source_version":1,"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-05-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FpZlbB5RJ1oXasEqMtPOTtkx9JP6BnGFADqP7T5qCYaCjXEMr+lFiTw6q+aHbFIgJokGS0Am7Z+OAKJaesNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:15:16.296149Z"},"content_sha256":"2c962808b2dfbb9852c040ae5bb52c16b33825642cc8cac61664ae0c0ad28e2d","schema_version":"1.0","event_id":"sha256:2c962808b2dfbb9852c040ae5bb52c16b33825642cc8cac61664ae0c0ad28e2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QBZI6KX5A77YS3IZYGQRB3FDTW","target":"graph","payload":{"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"},"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-05-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63Ne5rDoOJ71u9UHdtWgfHl2sNM3tfxL/1s4vKycb3H4g9/Q0vRwu0qD60I3OQuqMU2mtSrmK5zDWpi/GY1XCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:15:16.296804Z"},"content_sha256":"4d2d20b804003911046815055bd49f563c52e237963c6141c27cd644a7510f18","schema_version":"1.0","event_id":"sha256:4d2d20b804003911046815055bd49f563c52e237963c6141c27cd644a7510f18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/bundle.json","state_url":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/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-05-25T04:15:16Z","links":{"resolver":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW","bundle":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/bundle.json","state":"https://pith.science/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBZI6KX5A77YS3IZYGQRB3FDTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QBZI6KX5A77YS3IZYGQRB3FDTW","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":"f59e80bba41348a9d53c759c18e2a5265eac6fb3dc5d3187cd68be7c27f0924a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-02T17:18:53Z","title_canon_sha256":"ab6c063e013b508ac778d56f45fddaef37b29c6c80ff86ffa785891e153068b8"},"schema_version":"1.0","source":{"id":"1405.0456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0456","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0456v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0456","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"QBZI6KX5A77Y","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QBZI6KX5A77YS3IZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QBZI6KX5","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:4d2d20b804003911046815055bd49f563c52e237963c6141c27cd644a7510f18","target":"graph","created_at":"2026-05-18T02:52:42Z","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"},"paper":{"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.","authors_text":"Fabrizio Grandoni, Micha{\\l} W{\\l}odarczyk, Tomasz Kociumaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-02T17:18:53Z","title":"An LP-Rounding $2\\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0456","kind":"arxiv","version":1},"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:2c962808b2dfbb9852c040ae5bb52c16b33825642cc8cac61664ae0c0ad28e2d","target":"record","created_at":"2026-05-18T02:52:42Z","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":"f59e80bba41348a9d53c759c18e2a5265eac6fb3dc5d3187cd68be7c27f0924a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-02T17:18:53Z","title_canon_sha256":"ab6c063e013b508ac778d56f45fddaef37b29c6c80ff86ffa785891e153068b8"},"schema_version":"1.0","source":{"id":"1405.0456","kind":"arxiv","version":1}},"canonical_sha256":"80728f2afd07ff896d19c1a110eca39d822459f3a250f3bf718e43660ef79a9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80728f2afd07ff896d19c1a110eca39d822459f3a250f3bf718e43660ef79a9f","first_computed_at":"2026-05-18T02:52:42.605555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.605555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RDtH8MVTlEFLBxf9T2bL3+MIXTTe+UJwMEBQpebgGRUpjjHHtpWtZlFcFK2hHP2Pj+PkytciXm4mNgBaP+yVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.605991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c962808b2dfbb9852c040ae5bb52c16b33825642cc8cac61664ae0c0ad28e2d","sha256:4d2d20b804003911046815055bd49f563c52e237963c6141c27cd644a7510f18"],"state_sha256":"1fcb900e285d42009d019a532bd30758768e06fe5446ada779e04f5398a59706"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+qmpvfvuWHTX3es3jrjnDBc3iJZUCClQTP6ijqOD2KDvVf/kcAbuvdM7YYJAfvxedIrO4En/ymbu/DVIbT7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:15:16.300501Z","bundle_sha256":"a2e07fbb754a90bd200ae4a774b2c3143af307523065d15bfd12ad95107ff502"}}