{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PELU6J5W5PPCGY6XI6KZIPSHQQ","short_pith_number":"pith:PELU6J5W","canonical_record":{"source":{"id":"1901.07825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-23T11:25:50Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"8ad8fc8ce98e3e314adea72c02e8d296989de14087dbdea416513f29741616f7","abstract_canon_sha256":"6f61ec844a6718367e289e7a6dd4fd08bada24f6464f7e7b0c73942d4db18cd5"},"schema_version":"1.0"},"canonical_sha256":"79174f27b6ebde2363d74795943e47840bfa51d3e34b6b7ee49d6d3c02470dcd","source":{"kind":"arxiv","id":"1901.07825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07825","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07825v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07825","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"PELU6J5W5PPC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PELU6J5W5PPCGY6X","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PELU6J5W","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PELU6J5W5PPCGY6XI6KZIPSHQQ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-23T11:25:50Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"8ad8fc8ce98e3e314adea72c02e8d296989de14087dbdea416513f29741616f7","abstract_canon_sha256":"6f61ec844a6718367e289e7a6dd4fd08bada24f6464f7e7b0c73942d4db18cd5"},"schema_version":"1.0"},"canonical_sha256":"79174f27b6ebde2363d74795943e47840bfa51d3e34b6b7ee49d6d3c02470dcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.645655Z","signature_b64":"afRDDTqvIATQ/pazyqO0ydp2hhn12VgWyHpuzt42DTg8AkHcM17xRv5PmiutTxgVmnTgXN0nhTvYV4pnvjjrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79174f27b6ebde2363d74795943e47840bfa51d3e34b6b7ee49d6d3c02470dcd","last_reissued_at":"2026-05-17T23:55:39.645254Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.645254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07825","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:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RucEK8xJIhrLs6yzF/SrEWSQ+ddLAen9pM6uKTQsx+OGdTbsYXbOtC+754/rUXxXEA64vjB6xc6E1fQqFm0ABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:42:37.722825Z"},"content_sha256":"c7d54d62ad042b438ed845a3b2de4e0acc1dc27567b7e77881bcba0d1d602d5e","schema_version":"1.0","event_id":"sha256:c7d54d62ad042b438ed845a3b2de4e0acc1dc27567b7e77881bcba0d1d602d5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PELU6J5W5PPCGY6XI6KZIPSHQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Power of Symmetric Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.LO","authors_text":"Albert Atserias, Anuj Dawar, Joanna Ochremiak","submitted_at":"2019-01-23T11:25:50Z","abstract_excerpt":"We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points corresponding to graphs with the property from those corresponding to graphs without the property. We show that this is equivalent, with at most polynomial blow-up in size, to families of symmetric Boolean circuits with threshold gates. In particular, when we consider polynomial-size LPs, the model is equivalent to definability in a non-uniform version of f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07825","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:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bO7UEOEEZ4ARX4c5K7r1hbp6t1ewQnj6UMVJm7cpUCv9m89pyo8dtywf/+/Y2F09w7jToVK+bLczR114jS7JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:42:37.723176Z"},"content_sha256":"3cb976e1dc80b977bffa0160cbf7ccfc6d5309fb871e65131a5010632ffacee0","schema_version":"1.0","event_id":"sha256:3cb976e1dc80b977bffa0160cbf7ccfc6d5309fb871e65131a5010632ffacee0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PELU6J5W5PPCGY6XI6KZIPSHQQ/bundle.json","state_url":"https://pith.science/pith/PELU6J5W5PPCGY6XI6KZIPSHQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PELU6J5W5PPCGY6XI6KZIPSHQQ/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-11T09:42:37Z","links":{"resolver":"https://pith.science/pith/PELU6J5W5PPCGY6XI6KZIPSHQQ","bundle":"https://pith.science/pith/PELU6J5W5PPCGY6XI6KZIPSHQQ/bundle.json","state":"https://pith.science/pith/PELU6J5W5PPCGY6XI6KZIPSHQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PELU6J5W5PPCGY6XI6KZIPSHQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PELU6J5W5PPCGY6XI6KZIPSHQQ","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":"6f61ec844a6718367e289e7a6dd4fd08bada24f6464f7e7b0c73942d4db18cd5","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-23T11:25:50Z","title_canon_sha256":"8ad8fc8ce98e3e314adea72c02e8d296989de14087dbdea416513f29741616f7"},"schema_version":"1.0","source":{"id":"1901.07825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07825","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07825v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07825","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"PELU6J5W5PPC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PELU6J5W5PPCGY6X","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PELU6J5W","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:3cb976e1dc80b977bffa0160cbf7ccfc6d5309fb871e65131a5010632ffacee0","target":"graph","created_at":"2026-05-17T23:55:39Z","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 consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points corresponding to graphs with the property from those corresponding to graphs without the property. We show that this is equivalent, with at most polynomial blow-up in size, to families of symmetric Boolean circuits with threshold gates. In particular, when we consider polynomial-size LPs, the model is equivalent to definability in a non-uniform version of f","authors_text":"Albert Atserias, Anuj Dawar, Joanna Ochremiak","cross_cats":["cs.CC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-23T11:25:50Z","title":"On the Power of Symmetric Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07825","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:c7d54d62ad042b438ed845a3b2de4e0acc1dc27567b7e77881bcba0d1d602d5e","target":"record","created_at":"2026-05-17T23:55:39Z","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":"6f61ec844a6718367e289e7a6dd4fd08bada24f6464f7e7b0c73942d4db18cd5","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-23T11:25:50Z","title_canon_sha256":"8ad8fc8ce98e3e314adea72c02e8d296989de14087dbdea416513f29741616f7"},"schema_version":"1.0","source":{"id":"1901.07825","kind":"arxiv","version":1}},"canonical_sha256":"79174f27b6ebde2363d74795943e47840bfa51d3e34b6b7ee49d6d3c02470dcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79174f27b6ebde2363d74795943e47840bfa51d3e34b6b7ee49d6d3c02470dcd","first_computed_at":"2026-05-17T23:55:39.645254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:39.645254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"afRDDTqvIATQ/pazyqO0ydp2hhn12VgWyHpuzt42DTg8AkHcM17xRv5PmiutTxgVmnTgXN0nhTvYV4pnvjjrCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:39.645655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7d54d62ad042b438ed845a3b2de4e0acc1dc27567b7e77881bcba0d1d602d5e","sha256:3cb976e1dc80b977bffa0160cbf7ccfc6d5309fb871e65131a5010632ffacee0"],"state_sha256":"9e298bfa2456d586e1d257077145b3f399232cf2de26fac55c3cd02c8439c869"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3q6UVWOeoJqznp1q/J3oXjGc9xh8z36z41d0A9DvMdLV8ecTKVUYU67MUo4wIE73dpxHN6YN8/ki/1oSRY6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:42:37.725162Z","bundle_sha256":"2883c1d6333c39038ed3147a43abf01d28e7bd119e2266ef90cb51002d142d47"}}