{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2XMFJ6MZ4DTV42OYY6DJRB5M6V","short_pith_number":"pith:2XMFJ6MZ","schema_version":"1.0","canonical_sha256":"d5d854f999e0e75e69d8c7869887acf5470c55dd455b699887000c0c5bf4e5a2","source":{"kind":"arxiv","id":"1203.2801","version":1},"attestation_state":"computed","paper":{"title":"On Exact Algorithms for Permutation CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Goncalves, Eun Jung Kim","submitted_at":"2012-03-13T13:38:45Z","abstract_excerpt":"In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables $V$ and a set of constraints C, in which constraints are tuples of elements of V. The goal is to find a total ordering of the variables, $\\pi\\ : V \\rightarrow [1,...,|V|]$, which satisfies as many constraints as possible. A constraint $(v_1,v_2,...,v_k)$ is satisfied by an ordering $\\pi$ when $\\pi(v_1)<\\pi(v_2)<...<\\pi(v_k)$. An instance has arity $k$ if all the constraints involve at most $k$ elements.\n  This problem expresses a variety of permutation problems including {\\sc Feedback Arc Set} "},"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":"1203.2801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-13T13:38:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a58a0a2937600086cad78b9b5de5a8a00adb6e42297f927ef8a5dc2ef57ce047","abstract_canon_sha256":"11a02a34a9476fb979908f6f80b2fee775ea8af0631b75bc7a14e182665e9370"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:14.554266Z","signature_b64":"A1iChOBBf/iSFTcczEDk791dJKvbgjXnklSsvo/7gdAkBrzpAo5C93hhIv2xJlEUSun6ZbeJ3zkyQNEK9fkkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5d854f999e0e75e69d8c7869887acf5470c55dd455b699887000c0c5bf4e5a2","last_reissued_at":"2026-05-18T04:00:14.553586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:14.553586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Exact Algorithms for Permutation CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Goncalves, Eun Jung Kim","submitted_at":"2012-03-13T13:38:45Z","abstract_excerpt":"In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables $V$ and a set of constraints C, in which constraints are tuples of elements of V. The goal is to find a total ordering of the variables, $\\pi\\ : V \\rightarrow [1,...,|V|]$, which satisfies as many constraints as possible. A constraint $(v_1,v_2,...,v_k)$ is satisfied by an ordering $\\pi$ when $\\pi(v_1)<\\pi(v_2)<...<\\pi(v_k)$. An instance has arity $k$ if all the constraints involve at most $k$ elements.\n  This problem expresses a variety of permutation problems including {\\sc Feedback Arc Set} "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2801","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":"1203.2801","created_at":"2026-05-18T04:00:14.553683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2801v1","created_at":"2026-05-18T04:00:14.553683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2801","created_at":"2026-05-18T04:00:14.553683+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XMFJ6MZ4DTV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XMFJ6MZ4DTV42OY","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XMFJ6MZ","created_at":"2026-05-18T12:26:50.516681+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/2XMFJ6MZ4DTV42OYY6DJRB5M6V","json":"https://pith.science/pith/2XMFJ6MZ4DTV42OYY6DJRB5M6V.json","graph_json":"https://pith.science/api/pith-number/2XMFJ6MZ4DTV42OYY6DJRB5M6V/graph.json","events_json":"https://pith.science/api/pith-number/2XMFJ6MZ4DTV42OYY6DJRB5M6V/events.json","paper":"https://pith.science/paper/2XMFJ6MZ"},"agent_actions":{"view_html":"https://pith.science/pith/2XMFJ6MZ4DTV42OYY6DJRB5M6V","download_json":"https://pith.science/pith/2XMFJ6MZ4DTV42OYY6DJRB5M6V.json","view_paper":"https://pith.science/paper/2XMFJ6MZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2801&json=true","fetch_graph":"https://pith.science/api/pith-number/2XMFJ6MZ4DTV42OYY6DJRB5M6V/graph.json","fetch_events":"https://pith.science/api/pith-number/2XMFJ6MZ4DTV42OYY6DJRB5M6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XMFJ6MZ4DTV42OYY6DJRB5M6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XMFJ6MZ4DTV42OYY6DJRB5M6V/action/storage_attestation","attest_author":"https://pith.science/pith/2XMFJ6MZ4DTV42OYY6DJRB5M6V/action/author_attestation","sign_citation":"https://pith.science/pith/2XMFJ6MZ4DTV42OYY6DJRB5M6V/action/citation_signature","submit_replication":"https://pith.science/pith/2XMFJ6MZ4DTV42OYY6DJRB5M6V/action/replication_record"}},"created_at":"2026-05-18T04:00:14.553683+00:00","updated_at":"2026-05-18T04:00:14.553683+00:00"}