{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VWRI4U3JRDJIKXTB3MDJ73QLYG","short_pith_number":"pith:VWRI4U3J","schema_version":"1.0","canonical_sha256":"ada28e536988d2855e61db069fee0bc1835a5226c4118e4f821f2bd920de2e4e","source":{"kind":"arxiv","id":"1207.0932","version":2},"attestation_state":"computed","paper":{"title":"Folding graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ton Kloks, Yue-Li Wang","submitted_at":"2012-07-04T09:37:06Z","abstract_excerpt":"Let G be a graph. Consider two nonadjacent vertices x and y that have a common neighbor. Folding G with respect to x and y is the operation which identifies x and y. After a maximal series of foldings the graph is a disjoint union of cliques. The minimal clique number that can appear after a maximal series of foldings is equal to the chromatic number of G. In this paper we consider the problem to determine the maximal clique number which can appear after a maximal series of foldings. We denote this number as Sigma(G) and we call it the max-folding number. We show that the problem is NP-complet"},"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":"1207.0932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-04T09:37:06Z","cross_cats_sorted":[],"title_canon_sha256":"c15a7f8ee2bc503a66813378dab9af3d8ee5340d92af86605e52e6c734d805d2","abstract_canon_sha256":"3eaeb66199506fcb1e279ac96a7b9ecc680fe11063eb91af185fcfd5efe17402"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:34.861398Z","signature_b64":"RTeC3p7IXao4qMCNG26LW3VuRI2ZCpINbf6mELtkWx9PKamUKfYdvklW9H8MoP6Dku6RJasgwaKmeMb4Dv2aBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada28e536988d2855e61db069fee0bc1835a5226c4118e4f821f2bd920de2e4e","last_reissued_at":"2026-05-18T03:51:34.860761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:34.860761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Folding graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ton Kloks, Yue-Li Wang","submitted_at":"2012-07-04T09:37:06Z","abstract_excerpt":"Let G be a graph. Consider two nonadjacent vertices x and y that have a common neighbor. Folding G with respect to x and y is the operation which identifies x and y. After a maximal series of foldings the graph is a disjoint union of cliques. The minimal clique number that can appear after a maximal series of foldings is equal to the chromatic number of G. In this paper we consider the problem to determine the maximal clique number which can appear after a maximal series of foldings. We denote this number as Sigma(G) and we call it the max-folding number. We show that the problem is NP-complet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0932","kind":"arxiv","version":2},"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":"1207.0932","created_at":"2026-05-18T03:51:34.860869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0932v2","created_at":"2026-05-18T03:51:34.860869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0932","created_at":"2026-05-18T03:51:34.860869+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWRI4U3JRDJI","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWRI4U3JRDJIKXTB","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWRI4U3J","created_at":"2026-05-18T12:27:25.539911+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/VWRI4U3JRDJIKXTB3MDJ73QLYG","json":"https://pith.science/pith/VWRI4U3JRDJIKXTB3MDJ73QLYG.json","graph_json":"https://pith.science/api/pith-number/VWRI4U3JRDJIKXTB3MDJ73QLYG/graph.json","events_json":"https://pith.science/api/pith-number/VWRI4U3JRDJIKXTB3MDJ73QLYG/events.json","paper":"https://pith.science/paper/VWRI4U3J"},"agent_actions":{"view_html":"https://pith.science/pith/VWRI4U3JRDJIKXTB3MDJ73QLYG","download_json":"https://pith.science/pith/VWRI4U3JRDJIKXTB3MDJ73QLYG.json","view_paper":"https://pith.science/paper/VWRI4U3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0932&json=true","fetch_graph":"https://pith.science/api/pith-number/VWRI4U3JRDJIKXTB3MDJ73QLYG/graph.json","fetch_events":"https://pith.science/api/pith-number/VWRI4U3JRDJIKXTB3MDJ73QLYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWRI4U3JRDJIKXTB3MDJ73QLYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWRI4U3JRDJIKXTB3MDJ73QLYG/action/storage_attestation","attest_author":"https://pith.science/pith/VWRI4U3JRDJIKXTB3MDJ73QLYG/action/author_attestation","sign_citation":"https://pith.science/pith/VWRI4U3JRDJIKXTB3MDJ73QLYG/action/citation_signature","submit_replication":"https://pith.science/pith/VWRI4U3JRDJIKXTB3MDJ73QLYG/action/replication_record"}},"created_at":"2026-05-18T03:51:34.860869+00:00","updated_at":"2026-05-18T03:51:34.860869+00:00"}