{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H77CCPUR2PG4QDAUHHR4M7OUOC","short_pith_number":"pith:H77CCPUR","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"},"canonical_sha256":"3ffe213e91d3cdc80c1439e3c67dd470a076d6fce32e83afd8ce1eb59efe0745","source":{"kind":"arxiv","id":"1502.03555","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03555","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03555v2","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03555","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"H77CCPUR2PG4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H77CCPUR2PG4QDAU","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H77CCPUR","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H77CCPUR2PG4QDAUHHR4M7OUOC","target":"record","payload":{"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"},"canonical_sha256":"3ffe213e91d3cdc80c1439e3c67dd470a076d6fce32e83afd8ce1eb59efe0745","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"},"source_kind":"arxiv","source_id":"1502.03555","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIVsc0wYVo9slyfvyEC33LQrUOALyplbRF5mWqP8K8YfOO2oq+z2E0XpA+DA9rsZNWxi+yloFIAQfEgK/thWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:03:07.643744Z"},"content_sha256":"e0a3801471fb0ac8bc0802ab0ad71afa94a7f38c29aa827f8fb46363cddf3354","schema_version":"1.0","event_id":"sha256:e0a3801471fb0ac8bc0802ab0ad71afa94a7f38c29aa827f8fb46363cddf3354"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H77CCPUR2PG4QDAUHHR4M7OUOC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1OcGZR+60FYUPcPOOAcFf2jjksWWrfez8IEiFzyrgpEnqC7rOGtbT+wrbMLqzxDERq8aJERazk4gr3djGBqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:03:07.644082Z"},"content_sha256":"4c902a4b524f74b04f6efe3fc835dc075e551957aabb9d73eb7ba82c00cee74c","schema_version":"1.0","event_id":"sha256:4c902a4b524f74b04f6efe3fc835dc075e551957aabb9d73eb7ba82c00cee74c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/bundle.json","state_url":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T13:03:07Z","links":{"resolver":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC","bundle":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/bundle.json","state":"https://pith.science/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H77CCPUR2PG4QDAUHHR4M7OUOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H77CCPUR2PG4QDAUHHR4M7OUOC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bf0d6fae40d4bfd8d1db04ae9a3895c03852bf262a29cd25982a5794e01ea2e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-12T07:43:26Z","title_canon_sha256":"1b50fa1b2b54819d1efa1ed1fbe8f8bbed5850708a7486b45d3a8a826f12eff0"},"schema_version":"1.0","source":{"id":"1502.03555","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03555","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03555v2","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03555","created_at":"2026-05-18T01:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"H77CCPUR2PG4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H77CCPUR2PG4QDAU","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H77CCPUR","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:4c902a4b524f74b04f6efe3fc835dc075e551957aabb9d73eb7ba82c00cee74c","target":"graph","created_at":"2026-05-18T01:11:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Matthias Kriesell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-12T07:43:26Z","title":"Maximal ambiguously k-colorable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03555","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e0a3801471fb0ac8bc0802ab0ad71afa94a7f38c29aa827f8fb46363cddf3354","target":"record","created_at":"2026-05-18T01:11:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bf0d6fae40d4bfd8d1db04ae9a3895c03852bf262a29cd25982a5794e01ea2e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-12T07:43:26Z","title_canon_sha256":"1b50fa1b2b54819d1efa1ed1fbe8f8bbed5850708a7486b45d3a8a826f12eff0"},"schema_version":"1.0","source":{"id":"1502.03555","kind":"arxiv","version":2}},"canonical_sha256":"3ffe213e91d3cdc80c1439e3c67dd470a076d6fce32e83afd8ce1eb59efe0745","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ffe213e91d3cdc80c1439e3c67dd470a076d6fce32e83afd8ce1eb59efe0745","first_computed_at":"2026-05-18T01:11:55.222392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:55.222392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BV0aDguM3ubMIEKxLYVnYT+68rOmWQn1FXuiiSPlg+oPJFxsUCoJ2tEkCmfDBMoIsJgZulIPmiv1QKIF+AGhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:55.222762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03555","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0a3801471fb0ac8bc0802ab0ad71afa94a7f38c29aa827f8fb46363cddf3354","sha256:4c902a4b524f74b04f6efe3fc835dc075e551957aabb9d73eb7ba82c00cee74c"],"state_sha256":"e6315e803fc5786d8cb9e8cbe8474da25570f9f711be2fd30b3f35e86d539919"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghBpAXJ4RY8SOf4ImghL3qLgpgAYDFA5957H5P7HT0CWOgHr14+5AHhiBOfE6tvvbKcrsBhHwjPjUwyfg+HPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:03:07.645896Z","bundle_sha256":"e64425bb2ae325e248cdeed826a02fa7089569904df7363be8eaff65642e9bca"}}