{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I367ZGFIYXN5QXMOK7TGOHPJ6I","short_pith_number":"pith:I367ZGFI","schema_version":"1.0","canonical_sha256":"46fdfc98a8c5dbd85d8e57e6671de9f21fcbc392d6c10706f58c6b740daf3450","source":{"kind":"arxiv","id":"1312.2816","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Change","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jan van den Heuvel","submitted_at":"2013-12-10T14:41:46Z","abstract_excerpt":"Many combinatorial problems can be formulated as \"Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?\". An example of such a question is: given two k-colourings of a graph, can I transform the first k-colouring into the second one, by recolouring one vertex at a time, and always maintaining a proper k-colouring? Another example is: given two solutions of a SAT-instance, can I transform the first solution into the second one, by changing the truth value one variable at a time, and always maintaining a solution of the SAT-instance? Other examples ca"},"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":"1312.2816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-10T14:41:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e45f94feca29210b4f27821cba1f612b203a1c20a7d43859fbda61f313476777","abstract_canon_sha256":"7c0c923b015c47db3709f43c27995bf7d214c306aa307f61dd4f70c82e025cb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:08.673849Z","signature_b64":"Gvm9x2InteqbT3Nflcgdw+T1BvJGseUx4BmAVjwkQn8Dm/4uKQzqQBDcQeX5Y3Tlmqmz+rGazw5miawmiGdkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46fdfc98a8c5dbd85d8e57e6671de9f21fcbc392d6c10706f58c6b740daf3450","last_reissued_at":"2026-05-18T03:05:08.673197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:08.673197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Change","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jan van den Heuvel","submitted_at":"2013-12-10T14:41:46Z","abstract_excerpt":"Many combinatorial problems can be formulated as \"Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?\". An example of such a question is: given two k-colourings of a graph, can I transform the first k-colouring into the second one, by recolouring one vertex at a time, and always maintaining a proper k-colouring? Another example is: given two solutions of a SAT-instance, can I transform the first solution into the second one, by changing the truth value one variable at a time, and always maintaining a solution of the SAT-instance? Other examples ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2816","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":"1312.2816","created_at":"2026-05-18T03:05:08.673298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2816v1","created_at":"2026-05-18T03:05:08.673298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2816","created_at":"2026-05-18T03:05:08.673298+00:00"},{"alias_kind":"pith_short_12","alias_value":"I367ZGFIYXN5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I367ZGFIYXN5QXMO","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I367ZGFI","created_at":"2026-05-18T12:27:46.883200+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/I367ZGFIYXN5QXMOK7TGOHPJ6I","json":"https://pith.science/pith/I367ZGFIYXN5QXMOK7TGOHPJ6I.json","graph_json":"https://pith.science/api/pith-number/I367ZGFIYXN5QXMOK7TGOHPJ6I/graph.json","events_json":"https://pith.science/api/pith-number/I367ZGFIYXN5QXMOK7TGOHPJ6I/events.json","paper":"https://pith.science/paper/I367ZGFI"},"agent_actions":{"view_html":"https://pith.science/pith/I367ZGFIYXN5QXMOK7TGOHPJ6I","download_json":"https://pith.science/pith/I367ZGFIYXN5QXMOK7TGOHPJ6I.json","view_paper":"https://pith.science/paper/I367ZGFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2816&json=true","fetch_graph":"https://pith.science/api/pith-number/I367ZGFIYXN5QXMOK7TGOHPJ6I/graph.json","fetch_events":"https://pith.science/api/pith-number/I367ZGFIYXN5QXMOK7TGOHPJ6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I367ZGFIYXN5QXMOK7TGOHPJ6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I367ZGFIYXN5QXMOK7TGOHPJ6I/action/storage_attestation","attest_author":"https://pith.science/pith/I367ZGFIYXN5QXMOK7TGOHPJ6I/action/author_attestation","sign_citation":"https://pith.science/pith/I367ZGFIYXN5QXMOK7TGOHPJ6I/action/citation_signature","submit_replication":"https://pith.science/pith/I367ZGFIYXN5QXMOK7TGOHPJ6I/action/replication_record"}},"created_at":"2026-05-18T03:05:08.673298+00:00","updated_at":"2026-05-18T03:05:08.673298+00:00"}