{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WMRM3TLN2UAY33CSZJJBCNQEPG","short_pith_number":"pith:WMRM3TLN","canonical_record":{"source":{"id":"1410.2405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-09T09:50:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7a856327babd209032a1663cbcf85f7ca61312110e599777ab27724c3e57bf5d","abstract_canon_sha256":"e84180b99a2a2925a74f4f8197d64cdbd971e5867a4bbf2eaec892d44495a9a3"},"schema_version":"1.0"},"canonical_sha256":"b322cdcd6dd5018dec52ca5211360479972f63d82bc16ac22cfcbf19595511c6","source":{"kind":"arxiv","id":"1410.2405","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2405","created_at":"2026-05-18T01:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2405v2","created_at":"2026-05-18T01:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2405","created_at":"2026-05-18T01:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"WMRM3TLN2UAY","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WMRM3TLN2UAY33CS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WMRM3TLN","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WMRM3TLN2UAY33CSZJJBCNQEPG","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-09T09:50:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7a856327babd209032a1663cbcf85f7ca61312110e599777ab27724c3e57bf5d","abstract_canon_sha256":"e84180b99a2a2925a74f4f8197d64cdbd971e5867a4bbf2eaec892d44495a9a3"},"schema_version":"1.0"},"canonical_sha256":"b322cdcd6dd5018dec52ca5211360479972f63d82bc16ac22cfcbf19595511c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:25.696175Z","signature_b64":"55hEeE6efm2ekYNA+Yzy2IWdJ8vQ86ZdwnCxcv1DpKHCXGG1CnnKUktf0Kc1wNWySbfg0X2dH/HX0xX5ekDIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b322cdcd6dd5018dec52ca5211360479972f63d82bc16ac22cfcbf19595511c6","last_reissued_at":"2026-05-18T01:30:25.695472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:25.695472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2405","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:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uz3LfIdeR+GQaOqH4RIUgBCnGC8MjL2Ynvzy1HqoUfr0bjqphsCl0vnXs/HG5eIS0DKEhLuCRMG3noMKEpuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T05:03:50.813206Z"},"content_sha256":"1f57fcd4468f77b58b199809817942e75b865ffdfa5e2ac64983ad70fd2826ef","schema_version":"1.0","event_id":"sha256:1f57fcd4468f77b58b199809817942e75b865ffdfa5e2ac64983ad70fd2826ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WMRM3TLN2UAY33CSZJJBCNQEPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guessing Games on Triangle-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Anh N. Dang, Peter J. Cameron, Soren Riis","submitted_at":"2014-10-09T09:50:42Z","abstract_excerpt":"The guessing game introduced by Riis is a variant of the \"guessing your own hats\" game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing number gn(G) associated to the guessing game played on G. When we consider the directed edge to be bidirected, in other words, the graph G is undirected, Christofides and Markstrom introduced a method to bound the value of the guessing number from below using the fractional clique number Kf(G). In particular they showed gn(G) >= |V(G)| - Kf(G). Moreover, it is pointed out that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2405","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:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zV1Ha+nIYAgl+vGHREhymHsOrg4NSoDJOy9ve9vbdubngsSzaUJdaQXWSZM9Y2cC1qfVh2zo8KIHV04nbrfVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T05:03:50.813938Z"},"content_sha256":"03f7b4275c54ea2564f7818defd889196b6aa03968be382516f8846ebc5f3967","schema_version":"1.0","event_id":"sha256:03f7b4275c54ea2564f7818defd889196b6aa03968be382516f8846ebc5f3967"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMRM3TLN2UAY33CSZJJBCNQEPG/bundle.json","state_url":"https://pith.science/pith/WMRM3TLN2UAY33CSZJJBCNQEPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMRM3TLN2UAY33CSZJJBCNQEPG/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-05-20T05:03:50Z","links":{"resolver":"https://pith.science/pith/WMRM3TLN2UAY33CSZJJBCNQEPG","bundle":"https://pith.science/pith/WMRM3TLN2UAY33CSZJJBCNQEPG/bundle.json","state":"https://pith.science/pith/WMRM3TLN2UAY33CSZJJBCNQEPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMRM3TLN2UAY33CSZJJBCNQEPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WMRM3TLN2UAY33CSZJJBCNQEPG","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":"e84180b99a2a2925a74f4f8197d64cdbd971e5867a4bbf2eaec892d44495a9a3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-09T09:50:42Z","title_canon_sha256":"7a856327babd209032a1663cbcf85f7ca61312110e599777ab27724c3e57bf5d"},"schema_version":"1.0","source":{"id":"1410.2405","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2405","created_at":"2026-05-18T01:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2405v2","created_at":"2026-05-18T01:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2405","created_at":"2026-05-18T01:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"WMRM3TLN2UAY","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WMRM3TLN2UAY33CS","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WMRM3TLN","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:03f7b4275c54ea2564f7818defd889196b6aa03968be382516f8846ebc5f3967","target":"graph","created_at":"2026-05-18T01:30:25Z","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":"The guessing game introduced by Riis is a variant of the \"guessing your own hats\" game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing number gn(G) associated to the guessing game played on G. When we consider the directed edge to be bidirected, in other words, the graph G is undirected, Christofides and Markstrom introduced a method to bound the value of the guessing number from below using the fractional clique number Kf(G). In particular they showed gn(G) >= |V(G)| - Kf(G). Moreover, it is pointed out that","authors_text":"Anh N. Dang, Peter J. Cameron, Soren Riis","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-09T09:50:42Z","title":"Guessing Games on Triangle-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2405","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:1f57fcd4468f77b58b199809817942e75b865ffdfa5e2ac64983ad70fd2826ef","target":"record","created_at":"2026-05-18T01:30:25Z","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":"e84180b99a2a2925a74f4f8197d64cdbd971e5867a4bbf2eaec892d44495a9a3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-09T09:50:42Z","title_canon_sha256":"7a856327babd209032a1663cbcf85f7ca61312110e599777ab27724c3e57bf5d"},"schema_version":"1.0","source":{"id":"1410.2405","kind":"arxiv","version":2}},"canonical_sha256":"b322cdcd6dd5018dec52ca5211360479972f63d82bc16ac22cfcbf19595511c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b322cdcd6dd5018dec52ca5211360479972f63d82bc16ac22cfcbf19595511c6","first_computed_at":"2026-05-18T01:30:25.695472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:25.695472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55hEeE6efm2ekYNA+Yzy2IWdJ8vQ86ZdwnCxcv1DpKHCXGG1CnnKUktf0Kc1wNWySbfg0X2dH/HX0xX5ekDIAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:25.696175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2405","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f57fcd4468f77b58b199809817942e75b865ffdfa5e2ac64983ad70fd2826ef","sha256:03f7b4275c54ea2564f7818defd889196b6aa03968be382516f8846ebc5f3967"],"state_sha256":"f39570f894dff4e67f61efe6188158155a9673ae7b72863f86c8a6e5ca7b4fdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60Kz6F4ppUlTxmHaD0A89lq5ECnfyS4OtLufjeLzGWCbPJ6x/sxDIehXqeiXmV0HzQn+hwP34ffzOUi3/oGVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T05:03:50.818447Z","bundle_sha256":"358cb14c9b55ea53b00d4830d93bb8b7ee501ff435c0f337eca636a14edf4088"}}