{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GVHDTGSSR2JISPIMU5JY4V6GUM","short_pith_number":"pith:GVHDTGSS","canonical_record":{"source":{"id":"1204.0219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-01T15:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"2450314c3956ae6138d46ace99de8ad0fe3f32e93b94a009e7bdfe29bfb9e161","abstract_canon_sha256":"8e908e72ea229653f91d926c10742d4132099ec1777755c33f0073033a240357"},"schema_version":"1.0"},"canonical_sha256":"354e399a528e92893d0ca7538e57c6a31e55b83ec9a7253cd48f5a03c5ff43cd","source":{"kind":"arxiv","id":"1204.0219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0219","created_at":"2026-05-18T03:58:49Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0219v1","created_at":"2026-05-18T03:58:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0219","created_at":"2026-05-18T03:58:49Z"},{"alias_kind":"pith_short_12","alias_value":"GVHDTGSSR2JI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GVHDTGSSR2JISPIM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GVHDTGSS","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GVHDTGSSR2JISPIMU5JY4V6GUM","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-01T15:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"2450314c3956ae6138d46ace99de8ad0fe3f32e93b94a009e7bdfe29bfb9e161","abstract_canon_sha256":"8e908e72ea229653f91d926c10742d4132099ec1777755c33f0073033a240357"},"schema_version":"1.0"},"canonical_sha256":"354e399a528e92893d0ca7538e57c6a31e55b83ec9a7253cd48f5a03c5ff43cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:49.957685Z","signature_b64":"zyrNKD0om9BAdrakDsE+F3zFKLvQ5wnF3Tf8+ven0NmlXfuH+19Jw8eB71MD1aysf9o112x6Pf2WdyPSpkujAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"354e399a528e92893d0ca7538e57c6a31e55b83ec9a7253cd48f5a03c5ff43cd","last_reissued_at":"2026-05-18T03:58:49.957023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:49.957023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0219","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-18T03:58:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uH9j+zjVszl7OkfPZiKnC2YGNQmsWmII+aA88AL/sQRz8E9oIGWbIzWStFSjOT24Jx2bEXazIS0ss6VvLeMhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:13:27.284266Z"},"content_sha256":"84d2a711926511d139d6a65a65af127a789219ea40a4f0a47f0d960e5febe1d1","schema_version":"1.0","event_id":"sha256:84d2a711926511d139d6a65a65af127a789219ea40a4f0a47f0d960e5febe1d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GVHDTGSSR2JISPIMU5JY4V6GUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximation for Orienting Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Iftah Gamzu, Moti Medina","submitted_at":"2012-04-01T15:14:26Z","abstract_excerpt":"An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that admit a directed source-target path. This problem has recently arisen in the study of biological networks, and it also has applications in communication networks.\n  In this paper, we identify an interesting local-to-global orientation property. This property enables us to modify the best known algorithms for maximum mixed graph orientation and some of its speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0219","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-18T03:58:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xejn5hfEyFFAxlL+RKyyJdLmBn17LIUWSYuSnC0SU5VnpQVf8XqeDF1dADGfcR+6V/XisLM5UBoAToC2R7InCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:13:27.285070Z"},"content_sha256":"c3bfc2d1afbc6cc85bce5e3a46012d3537d89026d81bc89bb2d016b2160823e2","schema_version":"1.0","event_id":"sha256:c3bfc2d1afbc6cc85bce5e3a46012d3537d89026d81bc89bb2d016b2160823e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVHDTGSSR2JISPIMU5JY4V6GUM/bundle.json","state_url":"https://pith.science/pith/GVHDTGSSR2JISPIMU5JY4V6GUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVHDTGSSR2JISPIMU5JY4V6GUM/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-10T03:13:27Z","links":{"resolver":"https://pith.science/pith/GVHDTGSSR2JISPIMU5JY4V6GUM","bundle":"https://pith.science/pith/GVHDTGSSR2JISPIMU5JY4V6GUM/bundle.json","state":"https://pith.science/pith/GVHDTGSSR2JISPIMU5JY4V6GUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVHDTGSSR2JISPIMU5JY4V6GUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GVHDTGSSR2JISPIMU5JY4V6GUM","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":"8e908e72ea229653f91d926c10742d4132099ec1777755c33f0073033a240357","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-01T15:14:26Z","title_canon_sha256":"2450314c3956ae6138d46ace99de8ad0fe3f32e93b94a009e7bdfe29bfb9e161"},"schema_version":"1.0","source":{"id":"1204.0219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0219","created_at":"2026-05-18T03:58:49Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0219v1","created_at":"2026-05-18T03:58:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0219","created_at":"2026-05-18T03:58:49Z"},{"alias_kind":"pith_short_12","alias_value":"GVHDTGSSR2JI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GVHDTGSSR2JISPIM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GVHDTGSS","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:c3bfc2d1afbc6cc85bce5e3a46012d3537d89026d81bc89bb2d016b2160823e2","target":"graph","created_at":"2026-05-18T03:58:49Z","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":"An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that admit a directed source-target path. This problem has recently arisen in the study of biological networks, and it also has applications in communication networks.\n  In this paper, we identify an interesting local-to-global orientation property. This property enables us to modify the best known algorithms for maximum mixed graph orientation and some of its speci","authors_text":"Iftah Gamzu, Moti Medina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-01T15:14:26Z","title":"Improved Approximation for Orienting Mixed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0219","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:84d2a711926511d139d6a65a65af127a789219ea40a4f0a47f0d960e5febe1d1","target":"record","created_at":"2026-05-18T03:58:49Z","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":"8e908e72ea229653f91d926c10742d4132099ec1777755c33f0073033a240357","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-01T15:14:26Z","title_canon_sha256":"2450314c3956ae6138d46ace99de8ad0fe3f32e93b94a009e7bdfe29bfb9e161"},"schema_version":"1.0","source":{"id":"1204.0219","kind":"arxiv","version":1}},"canonical_sha256":"354e399a528e92893d0ca7538e57c6a31e55b83ec9a7253cd48f5a03c5ff43cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"354e399a528e92893d0ca7538e57c6a31e55b83ec9a7253cd48f5a03c5ff43cd","first_computed_at":"2026-05-18T03:58:49.957023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:49.957023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zyrNKD0om9BAdrakDsE+F3zFKLvQ5wnF3Tf8+ven0NmlXfuH+19Jw8eB71MD1aysf9o112x6Pf2WdyPSpkujAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:49.957685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84d2a711926511d139d6a65a65af127a789219ea40a4f0a47f0d960e5febe1d1","sha256:c3bfc2d1afbc6cc85bce5e3a46012d3537d89026d81bc89bb2d016b2160823e2"],"state_sha256":"c296f100cb8e7ffc562190dfca74e134883376f3d1d1464634f6fbfcfad91f44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfJ4JtznkxFnq7a75Fk59WB2JxuFl0baB9qWpBdehnZ/gUuLEdIccEMPyBad5Q97iQ45bMQmNrV2CdprGhXTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T03:13:27.289195Z","bundle_sha256":"76d1d9eb3ab9d95348f30870d86fca248b2ecea0c4a5334dfe0ed1a57f4372a2"}}