{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XAUS473KEMGR57GXRC4OUPNVGK","short_pith_number":"pith:XAUS473K","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"},"canonical_sha256":"b8292e7f6a230d1efcd788b8ea3db532ad1d76c64b1c3b068cdeb53c05c287e6","source":{"kind":"arxiv","id":"1303.3708","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3708","created_at":"2026-05-18T01:57:23Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3708v5","created_at":"2026-05-18T01:57:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3708","created_at":"2026-05-18T01:57:23Z"},{"alias_kind":"pith_short_12","alias_value":"XAUS473KEMGR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XAUS473KEMGR57GX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XAUS473K","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XAUS473KEMGR57GXRC4OUPNVGK","target":"record","payload":{"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"},"canonical_sha256":"b8292e7f6a230d1efcd788b8ea3db532ad1d76c64b1c3b068cdeb53c05c287e6","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"},"source_kind":"arxiv","source_id":"1303.3708","source_version":5,"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-18T01:57:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTn+m074MuOL/tKudtQz8YcnD94SBtedXVHI+WVanvA6Tf8+YISAITGpxLnlQfqIg/XUSOCMIoc+e4FJ0ihWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:20:30.269456Z"},"content_sha256":"7d8e7330cb1884bd30e883de6cb999659682ea9b17d7a9bae13b74cac6338cc8","schema_version":"1.0","event_id":"sha256:7d8e7330cb1884bd30e883de6cb999659682ea9b17d7a9bae13b74cac6338cc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XAUS473KEMGR57GXRC4OUPNVGK","target":"graph","payload":{"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"},"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-18T01:57:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7TwcU3hPhdovholLfW4/aPnoVQvuEMCp7jdWQDBcu96JvgnaTSQ76URNCaVXYaoHNB5R1ICABy1ZWZZ7DINAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:20:30.269806Z"},"content_sha256":"65cae95d717451f921ca5f48a4bd271dac38fd43470811a03fdc12416d2e7f21","schema_version":"1.0","event_id":"sha256:65cae95d717451f921ca5f48a4bd271dac38fd43470811a03fdc12416d2e7f21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/bundle.json","state_url":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XAUS473KEMGR57GXRC4OUPNVGK/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-05-20T08:20:30Z","links":{"resolver":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK","bundle":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/bundle.json","state":"https://pith.science/pith/XAUS473KEMGR57GXRC4OUPNVGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XAUS473KEMGR57GXRC4OUPNVGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XAUS473KEMGR57GXRC4OUPNVGK","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":"763d65a5b22560126dc83cbfa513b9628620d5fc5bf841b958a9ee72220ff511","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-15T09:07:55Z","title_canon_sha256":"99f71a539e833e70e1d8824eeab7970336b5ca9c61602141b35fc7275ed5557a"},"schema_version":"1.0","source":{"id":"1303.3708","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3708","created_at":"2026-05-18T01:57:23Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3708v5","created_at":"2026-05-18T01:57:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3708","created_at":"2026-05-18T01:57:23Z"},{"alias_kind":"pith_short_12","alias_value":"XAUS473KEMGR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XAUS473KEMGR57GX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XAUS473K","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:65cae95d717451f921ca5f48a4bd271dac38fd43470811a03fdc12416d2e7f21","target":"graph","created_at":"2026-05-18T01:57:23Z","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":"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.","authors_text":"K\\'evin Perrot, Trung Van Pham","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-15T09:07:55Z","title":"Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3708","kind":"arxiv","version":5},"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:7d8e7330cb1884bd30e883de6cb999659682ea9b17d7a9bae13b74cac6338cc8","target":"record","created_at":"2026-05-18T01:57:23Z","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":"763d65a5b22560126dc83cbfa513b9628620d5fc5bf841b958a9ee72220ff511","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-15T09:07:55Z","title_canon_sha256":"99f71a539e833e70e1d8824eeab7970336b5ca9c61602141b35fc7275ed5557a"},"schema_version":"1.0","source":{"id":"1303.3708","kind":"arxiv","version":5}},"canonical_sha256":"b8292e7f6a230d1efcd788b8ea3db532ad1d76c64b1c3b068cdeb53c05c287e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8292e7f6a230d1efcd788b8ea3db532ad1d76c64b1c3b068cdeb53c05c287e6","first_computed_at":"2026-05-18T01:57:23.744132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:57:23.744132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"png6teF+ttGnZAV8YkCZjlOwJQm2NPjFsDDjemUPc/avP4MTy1RaZtPuMt5K0K3RElVkYuyycKbElw3oRotpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:57:23.746968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3708","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d8e7330cb1884bd30e883de6cb999659682ea9b17d7a9bae13b74cac6338cc8","sha256:65cae95d717451f921ca5f48a4bd271dac38fd43470811a03fdc12416d2e7f21"],"state_sha256":"f7f6d5907e17b860dfc0d45dee326c2551f50c645f69c668466124fdbb8f9c0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QphUkVm+gLfGBXL0o5kg4ju4OpjRnnaboTqVgB4cB252uZs5ism24dYeV7Ta6r9Z0dXgZMxIKDGlSN9OcdQJBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T08:20:30.271764Z","bundle_sha256":"3f22b4672862596203976224c331c8634f8be156e4ac8814074c7a17cb94e7b0"}}