{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IUZU62RQYP7NJMBN7JMXTKRVGF","short_pith_number":"pith:IUZU62RQ","canonical_record":{"source":{"id":"1111.4299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-18T08:32:45Z","cross_cats_sorted":[],"title_canon_sha256":"cad51a17fcbc7df1e0f2f13140cb2a324cd850281f18d3c790f771b107918e5a","abstract_canon_sha256":"e0ef64712bbdd11d4541a4a2cf53041fb31c0eb3c389443ed9233520b8093fd8"},"schema_version":"1.0"},"canonical_sha256":"45334f6a30c3fed4b02dfa5979aa3531579dcf5570c93b79f788eeedb833f7e5","source":{"kind":"arxiv","id":"1111.4299","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4299","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4299v2","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4299","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"IUZU62RQYP7N","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IUZU62RQYP7NJMBN","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IUZU62RQ","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IUZU62RQYP7NJMBN7JMXTKRVGF","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-18T08:32:45Z","cross_cats_sorted":[],"title_canon_sha256":"cad51a17fcbc7df1e0f2f13140cb2a324cd850281f18d3c790f771b107918e5a","abstract_canon_sha256":"e0ef64712bbdd11d4541a4a2cf53041fb31c0eb3c389443ed9233520b8093fd8"},"schema_version":"1.0"},"canonical_sha256":"45334f6a30c3fed4b02dfa5979aa3531579dcf5570c93b79f788eeedb833f7e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:28.894643Z","signature_b64":"7N/wyjzlcOnmn71tQgsFa8cqyXP54n+ndaUsJFOFbtpePuGOCd5HDZhoVJcj6jjRLcmCD07lb7ZRbTm493adAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45334f6a30c3fed4b02dfa5979aa3531579dcf5570c93b79f788eeedb833f7e5","last_reissued_at":"2026-05-18T02:21:28.893914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:28.893914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4299","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-05-18T02:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kSqDSnO5BE1ksLxjdm9Ygj4PA9ZW26NV35/13zYPU1URwxtS8FzjRGm5ZKMWD3bqFgxrvF6kqAy+FCzSJBICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:50:19.382711Z"},"content_sha256":"a36bdc4a8b50267840105b814235367c57f5b1318f857c14c11d4882559901c9","schema_version":"1.0","event_id":"sha256:a36bdc4a8b50267840105b814235367c57f5b1318f857c14c11d4882559901c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IUZU62RQYP7NJMBN7JMXTKRVGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Monaldo Mastrolilli","submitted_at":"2011-11-18T08:32:45Z","abstract_excerpt":"We consider the (precedence constrained) Minimum Feedback Arc Set problem with triangle inequalities on the weights, which finds important applications in problems of ranking with inconsistent information. We present a surprising structural insight showing that the problem is a special case of the minimum vertex cover in hypergraphs with edges of size at most 3. This result leads to combinatorial approximation algorithms for the problem and opens the road to studying the problem as a vertex cover problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4299","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":""},"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:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dGyjpNns44xn36QIBqRQinJLpcNDgiKZfoTMUqgPkG2S2Bj94X9KjjLWesvmF5M9+2RwefwauEqoWif5SIvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:50:19.383055Z"},"content_sha256":"8b6720a9c64b37e84e60001046b9a18918ebe8c52e9cd86049c30fe3a17cf6ee","schema_version":"1.0","event_id":"sha256:8b6720a9c64b37e84e60001046b9a18918ebe8c52e9cd86049c30fe3a17cf6ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUZU62RQYP7NJMBN7JMXTKRVGF/bundle.json","state_url":"https://pith.science/pith/IUZU62RQYP7NJMBN7JMXTKRVGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUZU62RQYP7NJMBN7JMXTKRVGF/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-26T12:50:19Z","links":{"resolver":"https://pith.science/pith/IUZU62RQYP7NJMBN7JMXTKRVGF","bundle":"https://pith.science/pith/IUZU62RQYP7NJMBN7JMXTKRVGF/bundle.json","state":"https://pith.science/pith/IUZU62RQYP7NJMBN7JMXTKRVGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUZU62RQYP7NJMBN7JMXTKRVGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IUZU62RQYP7NJMBN7JMXTKRVGF","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":"e0ef64712bbdd11d4541a4a2cf53041fb31c0eb3c389443ed9233520b8093fd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-18T08:32:45Z","title_canon_sha256":"cad51a17fcbc7df1e0f2f13140cb2a324cd850281f18d3c790f771b107918e5a"},"schema_version":"1.0","source":{"id":"1111.4299","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4299","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4299v2","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4299","created_at":"2026-05-18T02:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"IUZU62RQYP7N","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IUZU62RQYP7NJMBN","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IUZU62RQ","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:8b6720a9c64b37e84e60001046b9a18918ebe8c52e9cd86049c30fe3a17cf6ee","target":"graph","created_at":"2026-05-18T02:21:28Z","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":"We consider the (precedence constrained) Minimum Feedback Arc Set problem with triangle inequalities on the weights, which finds important applications in problems of ranking with inconsistent information. We present a surprising structural insight showing that the problem is a special case of the minimum vertex cover in hypergraphs with edges of size at most 3. This result leads to combinatorial approximation algorithms for the problem and opens the road to studying the problem as a vertex cover problem.","authors_text":"Monaldo Mastrolilli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-18T08:32:45Z","title":"The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4299","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:a36bdc4a8b50267840105b814235367c57f5b1318f857c14c11d4882559901c9","target":"record","created_at":"2026-05-18T02:21:28Z","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":"e0ef64712bbdd11d4541a4a2cf53041fb31c0eb3c389443ed9233520b8093fd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-18T08:32:45Z","title_canon_sha256":"cad51a17fcbc7df1e0f2f13140cb2a324cd850281f18d3c790f771b107918e5a"},"schema_version":"1.0","source":{"id":"1111.4299","kind":"arxiv","version":2}},"canonical_sha256":"45334f6a30c3fed4b02dfa5979aa3531579dcf5570c93b79f788eeedb833f7e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45334f6a30c3fed4b02dfa5979aa3531579dcf5570c93b79f788eeedb833f7e5","first_computed_at":"2026-05-18T02:21:28.893914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:28.893914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7N/wyjzlcOnmn71tQgsFa8cqyXP54n+ndaUsJFOFbtpePuGOCd5HDZhoVJcj6jjRLcmCD07lb7ZRbTm493adAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:28.894643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4299","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a36bdc4a8b50267840105b814235367c57f5b1318f857c14c11d4882559901c9","sha256:8b6720a9c64b37e84e60001046b9a18918ebe8c52e9cd86049c30fe3a17cf6ee"],"state_sha256":"03029b4e3f4a9b9580a3b49535ef4b0aa1fce4756b6e52e594f0d649843ee7ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VS5waGFJoSklKJbBm7RY5VPVoTSeZXvn+6vETYZ+7uOGgltbmIw5X3kafoaJb4kDpYGruTdCjYnqzAfJlxoMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:50:19.385003Z","bundle_sha256":"320bd7fe5eb533e31d5e7bc20a3b817d880b94c679b812fba0b2ea3a74aefcf2"}}