{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5SL6IFRRGLT4X5U2WM6KCUVTTZ","short_pith_number":"pith:5SL6IFRR","canonical_record":{"source":{"id":"1812.08820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T19:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"2d05ddc03732ca6c71c142734060572d2bb957c764c2853d2d9126ad4819aab3","abstract_canon_sha256":"32647d6d8a562064b4987d19f70a7fc205fd05f099b42db1fe90bc2df3f0e54e"},"schema_version":"1.0"},"canonical_sha256":"ec97e4163132e7cbf69ab33ca152b39e5218f50ad8783166b03bcc4d516066c0","source":{"kind":"arxiv","id":"1812.08820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08820","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08820v1","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08820","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"5SL6IFRRGLT4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5SL6IFRRGLT4X5U2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5SL6IFRR","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5SL6IFRRGLT4X5U2WM6KCUVTTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T19:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"2d05ddc03732ca6c71c142734060572d2bb957c764c2853d2d9126ad4819aab3","abstract_canon_sha256":"32647d6d8a562064b4987d19f70a7fc205fd05f099b42db1fe90bc2df3f0e54e"},"schema_version":"1.0"},"canonical_sha256":"ec97e4163132e7cbf69ab33ca152b39e5218f50ad8783166b03bcc4d516066c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:46.187777Z","signature_b64":"FJci2MFnHzvR59CQawUOsGDFyJWV8xVD90y4oxmKsxMBZLGP1VKN9EYlql1AdZSbI4D+tyco75YhdhAGT5wGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec97e4163132e7cbf69ab33ca152b39e5218f50ad8783166b03bcc4d516066c0","last_reissued_at":"2026-05-17T23:57:46.187292Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:46.187292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08820","source_version":1,"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-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqrts9kk342EdVDq2z76ToopgncsusPTeTLTbsUrDnTl81guhyGHcR9Vj1X5mt+f9bxQ5VnSpEpF1UNqqwJ8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:32:01.666618Z"},"content_sha256":"81184cf48b234ec230fa6f9f82e37bcaf7ab2380548ddf070820cd951debf414","schema_version":"1.0","event_id":"sha256:81184cf48b234ec230fa6f9f82e37bcaf7ab2380548ddf070820cd951debf414"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5SL6IFRRGLT4X5U2WM6KCUVTTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Graph Density Inequalities with no Sum of Squares Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Annie Raymond, Grigoriy Blekherman, Mohit Singh, Rekha R. Thomas","submitted_at":"2018-12-20T19:56:42Z","abstract_excerpt":"Establishing inequalities among graph densities is a central pursuit in extremal combinatorics. A standard tool to certify the nonnegativity of a graph density expression is to write it as a sum of squares. In this paper, we identify a simple condition under which a graph density expression cannot be a sum of squares. Using this result, we prove that the Blakley-Roy inequality does not have a sum of squares certificate when the path length is odd. We also show that the same Blakley-Roy inequalities cannot be certified by sums of squares using a multiplier of the form one plus a sum of squares."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08820","kind":"arxiv","version":1},"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-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXCQB4sSJCeWD8giAMTvSGA2D0BeUhD8lXkav2MxXoWhKMQY8lo0L0hato46m8QBS+HYcv3ErIgS4kS0SVbtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:32:01.667230Z"},"content_sha256":"dc95e36addc2b95bb6b556191fa56c94085e1a66cde6d58f874b37ae7547c49d","schema_version":"1.0","event_id":"sha256:dc95e36addc2b95bb6b556191fa56c94085e1a66cde6d58f874b37ae7547c49d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/bundle.json","state_url":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/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-01T06:32:01Z","links":{"resolver":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ","bundle":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/bundle.json","state":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5SL6IFRRGLT4X5U2WM6KCUVTTZ","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":"32647d6d8a562064b4987d19f70a7fc205fd05f099b42db1fe90bc2df3f0e54e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T19:56:42Z","title_canon_sha256":"2d05ddc03732ca6c71c142734060572d2bb957c764c2853d2d9126ad4819aab3"},"schema_version":"1.0","source":{"id":"1812.08820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08820","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08820v1","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08820","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"5SL6IFRRGLT4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5SL6IFRRGLT4X5U2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5SL6IFRR","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:dc95e36addc2b95bb6b556191fa56c94085e1a66cde6d58f874b37ae7547c49d","target":"graph","created_at":"2026-05-17T23:57:46Z","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":"Establishing inequalities among graph densities is a central pursuit in extremal combinatorics. A standard tool to certify the nonnegativity of a graph density expression is to write it as a sum of squares. In this paper, we identify a simple condition under which a graph density expression cannot be a sum of squares. Using this result, we prove that the Blakley-Roy inequality does not have a sum of squares certificate when the path length is odd. We also show that the same Blakley-Roy inequalities cannot be certified by sums of squares using a multiplier of the form one plus a sum of squares.","authors_text":"Annie Raymond, Grigoriy Blekherman, Mohit Singh, Rekha R. Thomas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T19:56:42Z","title":"Simple Graph Density Inequalities with no Sum of Squares Proofs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08820","kind":"arxiv","version":1},"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:81184cf48b234ec230fa6f9f82e37bcaf7ab2380548ddf070820cd951debf414","target":"record","created_at":"2026-05-17T23:57:46Z","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":"32647d6d8a562064b4987d19f70a7fc205fd05f099b42db1fe90bc2df3f0e54e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-20T19:56:42Z","title_canon_sha256":"2d05ddc03732ca6c71c142734060572d2bb957c764c2853d2d9126ad4819aab3"},"schema_version":"1.0","source":{"id":"1812.08820","kind":"arxiv","version":1}},"canonical_sha256":"ec97e4163132e7cbf69ab33ca152b39e5218f50ad8783166b03bcc4d516066c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec97e4163132e7cbf69ab33ca152b39e5218f50ad8783166b03bcc4d516066c0","first_computed_at":"2026-05-17T23:57:46.187292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:46.187292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FJci2MFnHzvR59CQawUOsGDFyJWV8xVD90y4oxmKsxMBZLGP1VKN9EYlql1AdZSbI4D+tyco75YhdhAGT5wGCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:46.187777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81184cf48b234ec230fa6f9f82e37bcaf7ab2380548ddf070820cd951debf414","sha256:dc95e36addc2b95bb6b556191fa56c94085e1a66cde6d58f874b37ae7547c49d"],"state_sha256":"a6527c448877895ef07f93c51771c6466f3bdd8422d4aef85efa906226220430"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ah8xdKdHpXOBTm3aINDME8ElrkCOGen2wRkQDKR2VlUvTARM0rQPBbwte1G6TOkFQwm9ij3F4+AbEYFm9LGlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:32:01.670957Z","bundle_sha256":"fbb163ffe2b710cd1009936086545b0bfb7c0420c8929bd6e37e0c3a75849f41"}}