{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JJWN62OAU2BVV3VQU34XJKJUE2","short_pith_number":"pith:JJWN62OA","schema_version":"1.0","canonical_sha256":"4a6cdf69c0a6835aeeb0a6f974a934268bca91314c7ef6405433cb6175719b0b","source":{"kind":"arxiv","id":"1706.00911","version":1},"attestation_state":"computed","paper":{"title":"Inferring protein-protein interaction and protein-DNA interaction directions based on cause-effect pairs in undirected and mixed networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mehdy Roayaei, Mohammadreza Razzazi","submitted_at":"2017-06-03T08:16:01Z","abstract_excerpt":"We consider the following problem: Given an undirected (mixed) network and a set of ordered source-target, or cause-effect pairs, direct all edges so as to maximize the number of pairs that admit a directed source-target path. This is called maximum graph orientation problem, and has applications in understanding interactions in protein-protein interaction networks and protein-DNA interaction networks. We have studied the problem on both undirected and mixed networks. In the undirected case, we determine the parameterized complexity of the problem (for non-fixed and fixed paths) with respect t"},"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":"1706.00911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-03T08:16:01Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"777e9b70b65418a8c6856bcead696ee3f36c700dd36316402be2847e8e1b7797","abstract_canon_sha256":"a8ea7b2833939cf64bdbde895f103156ef73dd3ad34d01a09cbe00f84bcccb1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:07.443079Z","signature_b64":"2isaiRcWEtSYb0ibZWEzJPl23vpCcYtZgr+jSvbVc3BEqR/6GWYzKiIUIIXLC9Wx9RfkKNl5l8pb+8yFeX06CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a6cdf69c0a6835aeeb0a6f974a934268bca91314c7ef6405433cb6175719b0b","last_reissued_at":"2026-05-18T00:43:07.442358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:07.442358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inferring protein-protein interaction and protein-DNA interaction directions based on cause-effect pairs in undirected and mixed networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mehdy Roayaei, Mohammadreza Razzazi","submitted_at":"2017-06-03T08:16:01Z","abstract_excerpt":"We consider the following problem: Given an undirected (mixed) network and a set of ordered source-target, or cause-effect pairs, direct all edges so as to maximize the number of pairs that admit a directed source-target path. This is called maximum graph orientation problem, and has applications in understanding interactions in protein-protein interaction networks and protein-DNA interaction networks. We have studied the problem on both undirected and mixed networks. In the undirected case, we determine the parameterized complexity of the problem (for non-fixed and fixed paths) with respect t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00911","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":"1706.00911","created_at":"2026-05-18T00:43:07.442491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00911v1","created_at":"2026-05-18T00:43:07.442491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00911","created_at":"2026-05-18T00:43:07.442491+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJWN62OAU2BV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJWN62OAU2BVV3VQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJWN62OA","created_at":"2026-05-18T12:31:24.725408+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/JJWN62OAU2BVV3VQU34XJKJUE2","json":"https://pith.science/pith/JJWN62OAU2BVV3VQU34XJKJUE2.json","graph_json":"https://pith.science/api/pith-number/JJWN62OAU2BVV3VQU34XJKJUE2/graph.json","events_json":"https://pith.science/api/pith-number/JJWN62OAU2BVV3VQU34XJKJUE2/events.json","paper":"https://pith.science/paper/JJWN62OA"},"agent_actions":{"view_html":"https://pith.science/pith/JJWN62OAU2BVV3VQU34XJKJUE2","download_json":"https://pith.science/pith/JJWN62OAU2BVV3VQU34XJKJUE2.json","view_paper":"https://pith.science/paper/JJWN62OA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00911&json=true","fetch_graph":"https://pith.science/api/pith-number/JJWN62OAU2BVV3VQU34XJKJUE2/graph.json","fetch_events":"https://pith.science/api/pith-number/JJWN62OAU2BVV3VQU34XJKJUE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJWN62OAU2BVV3VQU34XJKJUE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJWN62OAU2BVV3VQU34XJKJUE2/action/storage_attestation","attest_author":"https://pith.science/pith/JJWN62OAU2BVV3VQU34XJKJUE2/action/author_attestation","sign_citation":"https://pith.science/pith/JJWN62OAU2BVV3VQU34XJKJUE2/action/citation_signature","submit_replication":"https://pith.science/pith/JJWN62OAU2BVV3VQU34XJKJUE2/action/replication_record"}},"created_at":"2026-05-18T00:43:07.442491+00:00","updated_at":"2026-05-18T00:43:07.442491+00:00"}