{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XAUS473KEMGR57GXRC4OUPNVGK","short_pith_number":"pith:XAUS473K","schema_version":"1.0","canonical_sha256":"b8292e7f6a230d1efcd788b8ea3db532ad1d76c64b1c3b068cdeb53c05c287e6","source":{"kind":"arxiv","id":"1303.3708","version":5},"attestation_state":"computed","paper":{"title":"Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"K\\'evin Perrot, Trung Van Pham","submitted_at":"2013-03-15T09:07:55Z","abstract_excerpt":"In this paper we present further studies of recurrent configurations of Chip-firing games on Eulerian directed graphs (simple digraphs), a class on the way from undirected graphs to general directed graphs. A computational problem that arises naturally from this model is to find the minimum number of chips of a recurrent configuration, which we call the minimum recurrent configuration (MINREC) problem. We point out a close relationship between MINREC and the minimum feedback arc set (MINFAS) problem on Eulerian directed graphs, and prove that both problems are NP-hard."},"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":"1303.3708","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-15T09:07:55Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"99f71a539e833e70e1d8824eeab7970336b5ca9c61602141b35fc7275ed5557a","abstract_canon_sha256":"763d65a5b22560126dc83cbfa513b9628620d5fc5bf841b958a9ee72220ff511"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:23.746968Z","signature_b64":"png6teF+ttGnZAV8YkCZjlOwJQm2NPjFsDDjemUPc/avP4MTy1RaZtPuMt5K0K3RElVkYuyycKbElw3oRotpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8292e7f6a230d1efcd788b8ea3db532ad1d76c64b1c3b068cdeb53c05c287e6","last_reissued_at":"2026-05-18T01:57:23.744132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:23.744132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"K\\'evin Perrot, Trung Van Pham","submitted_at":"2013-03-15T09:07:55Z","abstract_excerpt":"In this paper we present further studies of recurrent configurations of Chip-firing games on Eulerian directed graphs (simple digraphs), a class on the way from undirected graphs to general directed graphs. A computational problem that arises naturally from this model is to find the minimum number of chips of a recurrent configuration, which we call the minimum recurrent configuration (MINREC) problem. We point out a close relationship between MINREC and the minimum feedback arc set (MINFAS) problem on Eulerian directed graphs, and prove that both problems are NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3708","kind":"arxiv","version":5},"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":"1303.3708","created_at":"2026-05-18T01:57:23.744212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3708v5","created_at":"2026-05-18T01:57:23.744212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3708","created_at":"2026-05-18T01:57:23.744212+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAUS473KEMGR","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAUS473KEMGR57GX","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAUS473K","created_at":"2026-05-18T12:28:06.772260+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/XAUS473KEMGR57GXRC4OUPNVGK","json":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK.json","graph_json":"https://pith.science/api/pith-number/XAUS473KEMGR57GXRC4OUPNVGK/graph.json","events_json":"https://pith.science/api/pith-number/XAUS473KEMGR57GXRC4OUPNVGK/events.json","paper":"https://pith.science/paper/XAUS473K"},"agent_actions":{"view_html":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK","download_json":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK.json","view_paper":"https://pith.science/paper/XAUS473K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3708&json=true","fetch_graph":"https://pith.science/api/pith-number/XAUS473KEMGR57GXRC4OUPNVGK/graph.json","fetch_events":"https://pith.science/api/pith-number/XAUS473KEMGR57GXRC4OUPNVGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/action/storage_attestation","attest_author":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/action/author_attestation","sign_citation":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/action/citation_signature","submit_replication":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/action/replication_record"}},"created_at":"2026-05-18T01:57:23.744212+00:00","updated_at":"2026-05-18T01:57:23.744212+00:00"}