{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TNEOIVQ3JMYHTSNFF3KMWPUERG","short_pith_number":"pith:TNEOIVQ3","canonical_record":{"source":{"id":"1708.05118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-17T02:29:10Z","cross_cats_sorted":["cs.LG","math.CO"],"title_canon_sha256":"4a25e7ff8ae168f96fba61871beabdeaa39b9eef97fccc70f3cea766fd9392b4","abstract_canon_sha256":"7ff142061eb1e5564607b9800523d5641f5e487260500d3f45d5d8ddb24ede4e"},"schema_version":"1.0"},"canonical_sha256":"9b48e4561b4b3079c9a52ed4cb3e8489a7ddf31f6c5be6d2412e439cf893c292","source":{"kind":"arxiv","id":"1708.05118","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05118","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05118v2","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05118","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"TNEOIVQ3JMYH","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNEOIVQ3JMYHTSNF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNEOIVQ3","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TNEOIVQ3JMYHTSNFF3KMWPUERG","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-17T02:29:10Z","cross_cats_sorted":["cs.LG","math.CO"],"title_canon_sha256":"4a25e7ff8ae168f96fba61871beabdeaa39b9eef97fccc70f3cea766fd9392b4","abstract_canon_sha256":"7ff142061eb1e5564607b9800523d5641f5e487260500d3f45d5d8ddb24ede4e"},"schema_version":"1.0"},"canonical_sha256":"9b48e4561b4b3079c9a52ed4cb3e8489a7ddf31f6c5be6d2412e439cf893c292","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:43.120649Z","signature_b64":"dOW6bldE6/5ozOeffMhJeA+c801G/6emnnvYDrBVphUMoEiR1ECeb1PI61rvrJAreLGBWpGZQjvX9Ygsx4BCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b48e4561b4b3079c9a52ed4cb3e8489a7ddf31f6c5be6d2412e439cf893c292","last_reissued_at":"2026-05-18T00:17:43.120056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:43.120056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05118","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-18T00:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucJK9SV/qe44xU+ddBjKMpAclifd4eVgL/K2XAKvudl52uaMAfKluAOm80z/n2QRmfc0iWnm3hixte6HsalsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:12:59.420110Z"},"content_sha256":"78b50bcc75e721d965d06a0a997923229af1761579383bece8c05178ee6d3f83","schema_version":"1.0","event_id":"sha256:78b50bcc75e721d965d06a0a997923229af1761579383bece8c05178ee6d3f83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TNEOIVQ3JMYHTSNFF3KMWPUERG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure Learning of $H$-colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.CO"],"primary_cat":"cs.DM","authors_text":"Antonio Blanca, Daniel \\v{S}tefankovi\\v{c}, Eric Vigoda, Zongchen Chen","submitted_at":"2017-08-17T02:29:10Z","abstract_excerpt":"We study the structure learning problem for $H$-colorings, an important class of Markov random fields that capture key combinatorial structures on graphs, including proper colorings and independent sets, as well as spin systems from statistical physics. The learning problem is as follows: for a fixed (and known) constraint graph $H$ with $q$ colors and an unknown graph $G=(V,E)$ with $n$ vertices, given uniformly random $H$-colorings of $G$, how many samples are required to learn the edges of the unknown graph $G$? We give a characterization of $H$ for which the problem is identifiable for eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05118","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-18T00:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38FQ/pb+YLKm/CmRqxvyOAI367pq7cYJPA6JPIP+v+KL+ppr4CE/uLf/pHKSxBalXJawI20vh1gy0l+ctgA7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:12:59.420667Z"},"content_sha256":"06eb07cb9f4c49e599db28c121f9f75a4e6fd561bb9a4ae8e43d446c5122db9c","schema_version":"1.0","event_id":"sha256:06eb07cb9f4c49e599db28c121f9f75a4e6fd561bb9a4ae8e43d446c5122db9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNEOIVQ3JMYHTSNFF3KMWPUERG/bundle.json","state_url":"https://pith.science/pith/TNEOIVQ3JMYHTSNFF3KMWPUERG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNEOIVQ3JMYHTSNFF3KMWPUERG/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-12T09:12:59Z","links":{"resolver":"https://pith.science/pith/TNEOIVQ3JMYHTSNFF3KMWPUERG","bundle":"https://pith.science/pith/TNEOIVQ3JMYHTSNFF3KMWPUERG/bundle.json","state":"https://pith.science/pith/TNEOIVQ3JMYHTSNFF3KMWPUERG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNEOIVQ3JMYHTSNFF3KMWPUERG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TNEOIVQ3JMYHTSNFF3KMWPUERG","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":"7ff142061eb1e5564607b9800523d5641f5e487260500d3f45d5d8ddb24ede4e","cross_cats_sorted":["cs.LG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-17T02:29:10Z","title_canon_sha256":"4a25e7ff8ae168f96fba61871beabdeaa39b9eef97fccc70f3cea766fd9392b4"},"schema_version":"1.0","source":{"id":"1708.05118","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05118","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05118v2","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05118","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"TNEOIVQ3JMYH","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNEOIVQ3JMYHTSNF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNEOIVQ3","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:06eb07cb9f4c49e599db28c121f9f75a4e6fd561bb9a4ae8e43d446c5122db9c","target":"graph","created_at":"2026-05-18T00:17:43Z","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":"We study the structure learning problem for $H$-colorings, an important class of Markov random fields that capture key combinatorial structures on graphs, including proper colorings and independent sets, as well as spin systems from statistical physics. The learning problem is as follows: for a fixed (and known) constraint graph $H$ with $q$ colors and an unknown graph $G=(V,E)$ with $n$ vertices, given uniformly random $H$-colorings of $G$, how many samples are required to learn the edges of the unknown graph $G$? We give a characterization of $H$ for which the problem is identifiable for eve","authors_text":"Antonio Blanca, Daniel \\v{S}tefankovi\\v{c}, Eric Vigoda, Zongchen Chen","cross_cats":["cs.LG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-17T02:29:10Z","title":"Structure Learning of $H$-colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05118","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:78b50bcc75e721d965d06a0a997923229af1761579383bece8c05178ee6d3f83","target":"record","created_at":"2026-05-18T00:17:43Z","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":"7ff142061eb1e5564607b9800523d5641f5e487260500d3f45d5d8ddb24ede4e","cross_cats_sorted":["cs.LG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-17T02:29:10Z","title_canon_sha256":"4a25e7ff8ae168f96fba61871beabdeaa39b9eef97fccc70f3cea766fd9392b4"},"schema_version":"1.0","source":{"id":"1708.05118","kind":"arxiv","version":2}},"canonical_sha256":"9b48e4561b4b3079c9a52ed4cb3e8489a7ddf31f6c5be6d2412e439cf893c292","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b48e4561b4b3079c9a52ed4cb3e8489a7ddf31f6c5be6d2412e439cf893c292","first_computed_at":"2026-05-18T00:17:43.120056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:43.120056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dOW6bldE6/5ozOeffMhJeA+c801G/6emnnvYDrBVphUMoEiR1ECeb1PI61rvrJAreLGBWpGZQjvX9Ygsx4BCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:43.120649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05118","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78b50bcc75e721d965d06a0a997923229af1761579383bece8c05178ee6d3f83","sha256:06eb07cb9f4c49e599db28c121f9f75a4e6fd561bb9a4ae8e43d446c5122db9c"],"state_sha256":"f684de2f374f781befa590d810fd577ddbf07f7a5ce10697aa48c02dbfefd33e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ABaCq+5saut0gvwVrFXSZiivRmatBQoT/k4u6cuuDLdzvdbX5tY8gSqFbUV1vKwzoPYrNsQdIYuhg1XI/goDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:12:59.423299Z","bundle_sha256":"a0645f9088885034554306cb802532d5e239fbb77e5c88ba054e9ba76be65439"}}