{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IS7RRETBSKESNCZYJERRKJJYUV","short_pith_number":"pith:IS7RRETB","canonical_record":{"source":{"id":"1005.2382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-13T17:51:10Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"2d19997cb2439f922d41cdc45a4a4b3d5049c75413b149af1aaf42623245788b","abstract_canon_sha256":"31831e916df4a27cf11ae8b8fe4cca9821d7510c2cea2a5f68310863fa5ebc89"},"schema_version":"1.0"},"canonical_sha256":"44bf1892619289268b384923152538a5548ec28c581f5bc6a7203d6c9eb9bc94","source":{"kind":"arxiv","id":"1005.2382","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2382","created_at":"2026-05-18T04:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2382v3","created_at":"2026-05-18T04:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2382","created_at":"2026-05-18T04:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"IS7RRETBSKES","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IS7RRETBSKESNCZY","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IS7RRETB","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IS7RRETBSKESNCZYJERRKJJYUV","target":"record","payload":{"canonical_record":{"source":{"id":"1005.2382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-13T17:51:10Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"2d19997cb2439f922d41cdc45a4a4b3d5049c75413b149af1aaf42623245788b","abstract_canon_sha256":"31831e916df4a27cf11ae8b8fe4cca9821d7510c2cea2a5f68310863fa5ebc89"},"schema_version":"1.0"},"canonical_sha256":"44bf1892619289268b384923152538a5548ec28c581f5bc6a7203d6c9eb9bc94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:10.053704Z","signature_b64":"3vmP2XemtYXISog/nBRixeqXhsrBHh62P455xJpH+8uc1nSdjv9dXYSlQcGS4gB/oAH7ftxYBttI/f08GNf1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44bf1892619289268b384923152538a5548ec28c581f5bc6a7203d6c9eb9bc94","last_reissued_at":"2026-05-18T04:39:10.053078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:10.053078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.2382","source_version":3,"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-18T04:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNqG10+X0n8RwwR7S/43hJhPyRhCn7EbHXD8JAJztFpzY4UTLuqQcWU65ssdM7EWKdPsKHgQjJehxRlQvZePBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:33:32.162402Z"},"content_sha256":"c215477f7e22e9a87c09287074e9c1f0bb3d373374c5d7e35e7bef2d6b18118b","schema_version":"1.0","event_id":"sha256:c215477f7e22e9a87c09287074e9c1f0bb3d373374c5d7e35e7bef2d6b18118b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IS7RRETBSKESNCZYJERRKJJYUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Undecidability of linear inequalities in graph homomorphism densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Hamed Hatami, Serguei Norine","submitted_at":"2010-05-13T17:51:10Z","abstract_excerpt":"The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum graphs the validity of such an inequality is equivalent to the positivity of a corresponding quantum graph. Similar to the setting of polynomials, a quantum graph that can be represented as a sum of squares of labeled quantum graphs is necessarily positive. Lov\\'asz asks whether the opposite is also true. We answer this question and also a related question of Raz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2382","kind":"arxiv","version":3},"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-18T04:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yIGcbK2BbnoAyBoIpRaEFWoLJpGhFhhFKLC4nMWhtUeBufGlpy5qQCsbAoIcjV0fNTeKxAWxP4EK1UA6iTu4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:33:32.163132Z"},"content_sha256":"6de299c4298e11c1f58a03fd6e8e2dff31528999bf1c77ff95cd9c472074bfe8","schema_version":"1.0","event_id":"sha256:6de299c4298e11c1f58a03fd6e8e2dff31528999bf1c77ff95cd9c472074bfe8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS7RRETBSKESNCZYJERRKJJYUV/bundle.json","state_url":"https://pith.science/pith/IS7RRETBSKESNCZYJERRKJJYUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS7RRETBSKESNCZYJERRKJJYUV/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-30T13:33:32Z","links":{"resolver":"https://pith.science/pith/IS7RRETBSKESNCZYJERRKJJYUV","bundle":"https://pith.science/pith/IS7RRETBSKESNCZYJERRKJJYUV/bundle.json","state":"https://pith.science/pith/IS7RRETBSKESNCZYJERRKJJYUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS7RRETBSKESNCZYJERRKJJYUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IS7RRETBSKESNCZYJERRKJJYUV","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":"31831e916df4a27cf11ae8b8fe4cca9821d7510c2cea2a5f68310863fa5ebc89","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-13T17:51:10Z","title_canon_sha256":"2d19997cb2439f922d41cdc45a4a4b3d5049c75413b149af1aaf42623245788b"},"schema_version":"1.0","source":{"id":"1005.2382","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2382","created_at":"2026-05-18T04:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2382v3","created_at":"2026-05-18T04:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2382","created_at":"2026-05-18T04:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"IS7RRETBSKES","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IS7RRETBSKESNCZY","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IS7RRETB","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:6de299c4298e11c1f58a03fd6e8e2dff31528999bf1c77ff95cd9c472074bfe8","target":"graph","created_at":"2026-05-18T04:39:10Z","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 purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum graphs the validity of such an inequality is equivalent to the positivity of a corresponding quantum graph. Similar to the setting of polynomials, a quantum graph that can be represented as a sum of squares of labeled quantum graphs is necessarily positive. Lov\\'asz asks whether the opposite is also true. We answer this question and also a related question of Raz","authors_text":"Hamed Hatami, Serguei Norine","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-13T17:51:10Z","title":"Undecidability of linear inequalities in graph homomorphism densities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2382","kind":"arxiv","version":3},"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:c215477f7e22e9a87c09287074e9c1f0bb3d373374c5d7e35e7bef2d6b18118b","target":"record","created_at":"2026-05-18T04:39:10Z","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":"31831e916df4a27cf11ae8b8fe4cca9821d7510c2cea2a5f68310863fa5ebc89","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-13T17:51:10Z","title_canon_sha256":"2d19997cb2439f922d41cdc45a4a4b3d5049c75413b149af1aaf42623245788b"},"schema_version":"1.0","source":{"id":"1005.2382","kind":"arxiv","version":3}},"canonical_sha256":"44bf1892619289268b384923152538a5548ec28c581f5bc6a7203d6c9eb9bc94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44bf1892619289268b384923152538a5548ec28c581f5bc6a7203d6c9eb9bc94","first_computed_at":"2026-05-18T04:39:10.053078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:10.053078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3vmP2XemtYXISog/nBRixeqXhsrBHh62P455xJpH+8uc1nSdjv9dXYSlQcGS4gB/oAH7ftxYBttI/f08GNf1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:10.053704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.2382","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c215477f7e22e9a87c09287074e9c1f0bb3d373374c5d7e35e7bef2d6b18118b","sha256:6de299c4298e11c1f58a03fd6e8e2dff31528999bf1c77ff95cd9c472074bfe8"],"state_sha256":"e3dcc3ec01e0a5226c8c5ebbfa0a381af156c886253aedf19b610957344645f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QUYWMgfiipkpaVK213yTV6IVgcD4BbV8GMa9zdszPu0B2tsFdHx8/kO0HVkMFhGnE0mrqpRtnX3NGIDiJdwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:33:32.166745Z","bundle_sha256":"dfd86570cacf69aab474a1375fe5908fd5bdccc91b422a2bed5ac3c7deb9557e"}}