{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T5BQM3F5PYLMHB3R4HAN3HFWGJ","short_pith_number":"pith:T5BQM3F5","schema_version":"1.0","canonical_sha256":"9f43066cbd7e16c38771e1c0dd9cb632568ef94701fb1c6eee9e0acaf646a742","source":{"kind":"arxiv","id":"1705.05946","version":1},"attestation_state":"computed","paper":{"title":"Optimal segmentation of directed graph and the minimum number of feedback arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hai-Jun Zhou, Yi-Zhi Xu","submitted_at":"2017-05-16T22:54:58Z","abstract_excerpt":"The minimum feedback arc set problem asks to delete a minimum number of arcs (directed edges) from a digraph (directed graph) to make it free of any directed cycles. In this work we approach this fundamental cycle-constrained optimization problem by considering a generalized task of dividing the digraph into D layers of equal size. We solve the D-segmentation problem by the replica-symmetric mean field theory and belief-propagation heuristic algorithms. The minimum feedback arc density of a given random digraph ensemble is then obtained by extrapolating the theoretical results to the limit of "},"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":"1705.05946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-05-16T22:54:58Z","cross_cats_sorted":["cs.CC","physics.soc-ph"],"title_canon_sha256":"c690df3eb50433aed3f094b374fc3c63ef59d618ff95e4f3c55d641eb2fd80f8","abstract_canon_sha256":"e0fb392a679c80777bc4a38c389a1522a9bbae5b143300691a054356d9dd125c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:20.518971Z","signature_b64":"gAQeCxgAy/959zRSFSsVds5gem3Kc1Kd/URQrShhc60D0huDO3KXHZuv4oaEb+grUtvzv7PYF8lzBPr+5MOPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f43066cbd7e16c38771e1c0dd9cb632568ef94701fb1c6eee9e0acaf646a742","last_reissued_at":"2026-05-18T00:35:20.518525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:20.518525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal segmentation of directed graph and the minimum number of feedback arcs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Hai-Jun Zhou, Yi-Zhi Xu","submitted_at":"2017-05-16T22:54:58Z","abstract_excerpt":"The minimum feedback arc set problem asks to delete a minimum number of arcs (directed edges) from a digraph (directed graph) to make it free of any directed cycles. In this work we approach this fundamental cycle-constrained optimization problem by considering a generalized task of dividing the digraph into D layers of equal size. We solve the D-segmentation problem by the replica-symmetric mean field theory and belief-propagation heuristic algorithms. The minimum feedback arc density of a given random digraph ensemble is then obtained by extrapolating the theoretical results to the limit of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05946","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":"1705.05946","created_at":"2026-05-18T00:35:20.518597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05946v1","created_at":"2026-05-18T00:35:20.518597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05946","created_at":"2026-05-18T00:35:20.518597+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5BQM3F5PYLM","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5BQM3F5PYLMHB3R","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5BQM3F5","created_at":"2026-05-18T12:31:43.269735+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/T5BQM3F5PYLMHB3R4HAN3HFWGJ","json":"https://pith.science/pith/T5BQM3F5PYLMHB3R4HAN3HFWGJ.json","graph_json":"https://pith.science/api/pith-number/T5BQM3F5PYLMHB3R4HAN3HFWGJ/graph.json","events_json":"https://pith.science/api/pith-number/T5BQM3F5PYLMHB3R4HAN3HFWGJ/events.json","paper":"https://pith.science/paper/T5BQM3F5"},"agent_actions":{"view_html":"https://pith.science/pith/T5BQM3F5PYLMHB3R4HAN3HFWGJ","download_json":"https://pith.science/pith/T5BQM3F5PYLMHB3R4HAN3HFWGJ.json","view_paper":"https://pith.science/paper/T5BQM3F5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05946&json=true","fetch_graph":"https://pith.science/api/pith-number/T5BQM3F5PYLMHB3R4HAN3HFWGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/T5BQM3F5PYLMHB3R4HAN3HFWGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5BQM3F5PYLMHB3R4HAN3HFWGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5BQM3F5PYLMHB3R4HAN3HFWGJ/action/storage_attestation","attest_author":"https://pith.science/pith/T5BQM3F5PYLMHB3R4HAN3HFWGJ/action/author_attestation","sign_citation":"https://pith.science/pith/T5BQM3F5PYLMHB3R4HAN3HFWGJ/action/citation_signature","submit_replication":"https://pith.science/pith/T5BQM3F5PYLMHB3R4HAN3HFWGJ/action/replication_record"}},"created_at":"2026-05-18T00:35:20.518597+00:00","updated_at":"2026-05-18T00:35:20.518597+00:00"}