{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WL5K5ZRKMX476UESCISFJ25XVX","short_pith_number":"pith:WL5K5ZRK","schema_version":"1.0","canonical_sha256":"b2faaee62a65f9ff5092122454ebb7addb5bd976a973250d2503091f8fa43fc5","source":{"kind":"arxiv","id":"1106.2870","version":3},"attestation_state":"computed","paper":{"title":"Multicolor and directed edit distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan R. Martin","submitted_at":"2011-06-15T04:44:54Z","abstract_excerpt":"The editing of a combinatorial object is the alteration of some of its elements such that the resulting object satisfies a certain fixed property. The edit problem for graphs, when the edges are added or deleted, was first studied independently by the authors and K\\'ezdy [J. Graph Theory (2008), 58(2), 123--138] and by Alon and Stav [Random Structures Algorithms (2008), 33(1), 87--104]. In this paper, a generalization of graph editing is considered for multicolorings of the complete graph as well as for directed graphs. Specifically, the number of edge-recolorings sufficient to be performed on"},"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":"1106.2870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-15T04:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"fc3c5b64600300075d0e5eb5e0ac8ad8962f75c7d794dc37e02e3128a5bfb4ac","abstract_canon_sha256":"f69cea8114df3d82ede18e2466e595a315ee72816cdda534c299f64ab5a3e725"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:18.651393Z","signature_b64":"O84+qvJ2T8/kxxzJcrM1xXLCrUtshnRKwdwT89tKJGZ+6gEkV/1tk6bbtRpDyWD5PIfngYMl0CNZTlntFhhUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2faaee62a65f9ff5092122454ebb7addb5bd976a973250d2503091f8fa43fc5","last_reissued_at":"2026-05-18T01:14:18.650770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:18.650770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicolor and directed edit distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan R. Martin","submitted_at":"2011-06-15T04:44:54Z","abstract_excerpt":"The editing of a combinatorial object is the alteration of some of its elements such that the resulting object satisfies a certain fixed property. The edit problem for graphs, when the edges are added or deleted, was first studied independently by the authors and K\\'ezdy [J. Graph Theory (2008), 58(2), 123--138] and by Alon and Stav [Random Structures Algorithms (2008), 33(1), 87--104]. In this paper, a generalization of graph editing is considered for multicolorings of the complete graph as well as for directed graphs. Specifically, the number of edge-recolorings sufficient to be performed on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2870","kind":"arxiv","version":3},"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":"1106.2870","created_at":"2026-05-18T01:14:18.650859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2870v3","created_at":"2026-05-18T01:14:18.650859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2870","created_at":"2026-05-18T01:14:18.650859+00:00"},{"alias_kind":"pith_short_12","alias_value":"WL5K5ZRKMX47","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WL5K5ZRKMX476UES","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WL5K5ZRK","created_at":"2026-05-18T12:26:44.992195+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/WL5K5ZRKMX476UESCISFJ25XVX","json":"https://pith.science/pith/WL5K5ZRKMX476UESCISFJ25XVX.json","graph_json":"https://pith.science/api/pith-number/WL5K5ZRKMX476UESCISFJ25XVX/graph.json","events_json":"https://pith.science/api/pith-number/WL5K5ZRKMX476UESCISFJ25XVX/events.json","paper":"https://pith.science/paper/WL5K5ZRK"},"agent_actions":{"view_html":"https://pith.science/pith/WL5K5ZRKMX476UESCISFJ25XVX","download_json":"https://pith.science/pith/WL5K5ZRKMX476UESCISFJ25XVX.json","view_paper":"https://pith.science/paper/WL5K5ZRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2870&json=true","fetch_graph":"https://pith.science/api/pith-number/WL5K5ZRKMX476UESCISFJ25XVX/graph.json","fetch_events":"https://pith.science/api/pith-number/WL5K5ZRKMX476UESCISFJ25XVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WL5K5ZRKMX476UESCISFJ25XVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WL5K5ZRKMX476UESCISFJ25XVX/action/storage_attestation","attest_author":"https://pith.science/pith/WL5K5ZRKMX476UESCISFJ25XVX/action/author_attestation","sign_citation":"https://pith.science/pith/WL5K5ZRKMX476UESCISFJ25XVX/action/citation_signature","submit_replication":"https://pith.science/pith/WL5K5ZRKMX476UESCISFJ25XVX/action/replication_record"}},"created_at":"2026-05-18T01:14:18.650859+00:00","updated_at":"2026-05-18T01:14:18.650859+00:00"}