{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5SL6IFRRGLT4X5U2WM6KCUVTTZ","short_pith_number":"pith:5SL6IFRR","schema_version":"1.0","canonical_sha256":"ec97e4163132e7cbf69ab33ca152b39e5218f50ad8783166b03bcc4d516066c0","source":{"kind":"arxiv","id":"1812.08820","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.08820","created_at":"2026-05-17T23:57:46.187384+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08820v1","created_at":"2026-05-17T23:57:46.187384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08820","created_at":"2026-05-17T23:57:46.187384+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SL6IFRRGLT4","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SL6IFRRGLT4X5U2","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SL6IFRR","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ","json":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ.json","graph_json":"https://pith.science/api/pith-number/5SL6IFRRGLT4X5U2WM6KCUVTTZ/graph.json","events_json":"https://pith.science/api/pith-number/5SL6IFRRGLT4X5U2WM6KCUVTTZ/events.json","paper":"https://pith.science/paper/5SL6IFRR"},"agent_actions":{"view_html":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ","download_json":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ.json","view_paper":"https://pith.science/paper/5SL6IFRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08820&json=true","fetch_graph":"https://pith.science/api/pith-number/5SL6IFRRGLT4X5U2WM6KCUVTTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5SL6IFRRGLT4X5U2WM6KCUVTTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/action/storage_attestation","attest_author":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/action/author_attestation","sign_citation":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/action/citation_signature","submit_replication":"https://pith.science/pith/5SL6IFRRGLT4X5U2WM6KCUVTTZ/action/replication_record"}},"created_at":"2026-05-17T23:57:46.187384+00:00","updated_at":"2026-05-17T23:57:46.187384+00:00"}