{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H77CCPUR2PG4QDAUHHR4M7OUOC","short_pith_number":"pith:H77CCPUR","schema_version":"1.0","canonical_sha256":"3ffe213e91d3cdc80c1439e3c67dd470a076d6fce32e83afd8ce1eb59efe0745","source":{"kind":"arxiv","id":"1502.03555","version":2},"attestation_state":"computed","paper":{"title":"Maximal ambiguously k-colorable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Kriesell","submitted_at":"2015-02-12T07:43:26Z","abstract_excerpt":"A graph is ambiguously k-colorable if its vertex set admits two distinct partitions each into at most k anticliques. We give a full characterization of the maximally ambiguously k-colorable graphs in terms of quadratic matrices. As an application, we calculate the maximum number of edges an ambiguously k-colorable graph can have, and characterize the extremal graphs."},"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":"1502.03555","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-12T07:43:26Z","cross_cats_sorted":[],"title_canon_sha256":"1b50fa1b2b54819d1efa1ed1fbe8f8bbed5850708a7486b45d3a8a826f12eff0","abstract_canon_sha256":"bf0d6fae40d4bfd8d1db04ae9a3895c03852bf262a29cd25982a5794e01ea2e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:55.222762Z","signature_b64":"BV0aDguM3ubMIEKxLYVnYT+68rOmWQn1FXuiiSPlg+oPJFxsUCoJ2tEkCmfDBMoIsJgZulIPmiv1QKIF+AGhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ffe213e91d3cdc80c1439e3c67dd470a076d6fce32e83afd8ce1eb59efe0745","last_reissued_at":"2026-05-18T01:11:55.222392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:55.222392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal ambiguously k-colorable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Kriesell","submitted_at":"2015-02-12T07:43:26Z","abstract_excerpt":"A graph is ambiguously k-colorable if its vertex set admits two distinct partitions each into at most k anticliques. We give a full characterization of the maximally ambiguously k-colorable graphs in terms of quadratic matrices. As an application, we calculate the maximum number of edges an ambiguously k-colorable graph can have, and characterize the extremal graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03555","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":"1502.03555","created_at":"2026-05-18T01:11:55.222458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03555v2","created_at":"2026-05-18T01:11:55.222458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03555","created_at":"2026-05-18T01:11:55.222458+00:00"},{"alias_kind":"pith_short_12","alias_value":"H77CCPUR2PG4","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H77CCPUR2PG4QDAU","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H77CCPUR","created_at":"2026-05-18T12:29:22.688609+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/H77CCPUR2PG4QDAUHHR4M7OUOC","json":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC.json","graph_json":"https://pith.science/api/pith-number/H77CCPUR2PG4QDAUHHR4M7OUOC/graph.json","events_json":"https://pith.science/api/pith-number/H77CCPUR2PG4QDAUHHR4M7OUOC/events.json","paper":"https://pith.science/paper/H77CCPUR"},"agent_actions":{"view_html":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC","download_json":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC.json","view_paper":"https://pith.science/paper/H77CCPUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03555&json=true","fetch_graph":"https://pith.science/api/pith-number/H77CCPUR2PG4QDAUHHR4M7OUOC/graph.json","fetch_events":"https://pith.science/api/pith-number/H77CCPUR2PG4QDAUHHR4M7OUOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/action/storage_attestation","attest_author":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/action/author_attestation","sign_citation":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/action/citation_signature","submit_replication":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/action/replication_record"}},"created_at":"2026-05-18T01:11:55.222458+00:00","updated_at":"2026-05-18T01:11:55.222458+00:00"}