{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NENTF4X4OWXEMVRSTUKA6WE5QS","short_pith_number":"pith:NENTF4X4","canonical_record":{"source":{"id":"1611.04548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T20:11:38Z","cross_cats_sorted":["math.CO","math.OC","math.PR"],"title_canon_sha256":"52e8a8d30e79fc40325b6d9b8e5861f45ab7cba7a45c6f3228db05a8904f7a7c","abstract_canon_sha256":"8b0bb6c2da0f68b7218eef3ca4ba0e9f230548041243249cc44d9452ae437b00"},"schema_version":"1.0"},"canonical_sha256":"691b32f2fc75ae4656329d140f589d849f7c99d5e055f7b39685384630947b77","source":{"kind":"arxiv","id":"1611.04548","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04548","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04548v1","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04548","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"NENTF4X4OWXE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NENTF4X4OWXEMVRS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NENTF4X4","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NENTF4X4OWXEMVRSTUKA6WE5QS","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T20:11:38Z","cross_cats_sorted":["math.CO","math.OC","math.PR"],"title_canon_sha256":"52e8a8d30e79fc40325b6d9b8e5861f45ab7cba7a45c6f3228db05a8904f7a7c","abstract_canon_sha256":"8b0bb6c2da0f68b7218eef3ca4ba0e9f230548041243249cc44d9452ae437b00"},"schema_version":"1.0"},"canonical_sha256":"691b32f2fc75ae4656329d140f589d849f7c99d5e055f7b39685384630947b77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:12.815377Z","signature_b64":"61FtUFXLl47zK1RRGUeLE0Gq8WDmjWD8UQvDKI/gGF3F8r9sN+IV+YlI2KDrmNYqAm9isqTlsWBoZbh/Ag2JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691b32f2fc75ae4656329d140f589d849f7c99d5e055f7b39685384630947b77","last_reissued_at":"2026-05-18T00:59:12.814736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:12.814736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04548","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-18T00:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mvt3ZQNFlXqZMC4goVuPaqNztumFcoc+jsfoa685SbzuZWYTRCoxB4F/CgH8+deF/OHAw1E7uI4cqK9KI4OWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:03:52.870351Z"},"content_sha256":"e1a707f80d039f163ae8f2e3fcb35b49d58ead99ff23e1733ef3812ef02e53a8","schema_version":"1.0","event_id":"sha256:e1a707f80d039f163ae8f2e3fcb35b49d58ead99ff23e1733ef3812ef02e53a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NENTF4X4OWXEMVRSTUKA6WE5QS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real Stable Polynomials and Matroids: Optimization and Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC","math.PR"],"primary_cat":"cs.DS","authors_text":"Damian Straszak, Nisheeth K. Vishnoi","submitted_at":"2016-11-14T20:11:38Z","abstract_excerpt":"A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate real polynomial $g$ and a family of subsets $B$ of $[m]$, (1) find $S\\in B$ such that the monomial in $g$ corresponding to $S$ has the largest coefficient in $g$, or (2) compute the sum of coefficients of monomials in $g$ corresponding to all the sets in $B$. Special cases of these problems, such as computing permanents, sampling from DPPs and maximizing subde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04548","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-18T00:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IxLZJjWAkoqokHA+wPFiPUIoWV8Yhw3oDx7MTpBUNiCov9Y8i44keIcVgMYUjrVyLZ5qO2oaliJKLm8mXWv3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:03:52.870834Z"},"content_sha256":"d67a48e3935daf76b69bd87d20d89ecee4094bac76c9d3770189993ae26d3cb1","schema_version":"1.0","event_id":"sha256:d67a48e3935daf76b69bd87d20d89ecee4094bac76c9d3770189993ae26d3cb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NENTF4X4OWXEMVRSTUKA6WE5QS/bundle.json","state_url":"https://pith.science/pith/NENTF4X4OWXEMVRSTUKA6WE5QS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NENTF4X4OWXEMVRSTUKA6WE5QS/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-04T15:03:52Z","links":{"resolver":"https://pith.science/pith/NENTF4X4OWXEMVRSTUKA6WE5QS","bundle":"https://pith.science/pith/NENTF4X4OWXEMVRSTUKA6WE5QS/bundle.json","state":"https://pith.science/pith/NENTF4X4OWXEMVRSTUKA6WE5QS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NENTF4X4OWXEMVRSTUKA6WE5QS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NENTF4X4OWXEMVRSTUKA6WE5QS","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":"8b0bb6c2da0f68b7218eef3ca4ba0e9f230548041243249cc44d9452ae437b00","cross_cats_sorted":["math.CO","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T20:11:38Z","title_canon_sha256":"52e8a8d30e79fc40325b6d9b8e5861f45ab7cba7a45c6f3228db05a8904f7a7c"},"schema_version":"1.0","source":{"id":"1611.04548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04548","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04548v1","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04548","created_at":"2026-05-18T00:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"NENTF4X4OWXE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NENTF4X4OWXEMVRS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NENTF4X4","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:d67a48e3935daf76b69bd87d20d89ecee4094bac76c9d3770189993ae26d3cb1","target":"graph","created_at":"2026-05-18T00:59:12Z","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":"A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate real polynomial $g$ and a family of subsets $B$ of $[m]$, (1) find $S\\in B$ such that the monomial in $g$ corresponding to $S$ has the largest coefficient in $g$, or (2) compute the sum of coefficients of monomials in $g$ corresponding to all the sets in $B$. Special cases of these problems, such as computing permanents, sampling from DPPs and maximizing subde","authors_text":"Damian Straszak, Nisheeth K. Vishnoi","cross_cats":["math.CO","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T20:11:38Z","title":"Real Stable Polynomials and Matroids: Optimization and Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04548","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:e1a707f80d039f163ae8f2e3fcb35b49d58ead99ff23e1733ef3812ef02e53a8","target":"record","created_at":"2026-05-18T00:59:12Z","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":"8b0bb6c2da0f68b7218eef3ca4ba0e9f230548041243249cc44d9452ae437b00","cross_cats_sorted":["math.CO","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T20:11:38Z","title_canon_sha256":"52e8a8d30e79fc40325b6d9b8e5861f45ab7cba7a45c6f3228db05a8904f7a7c"},"schema_version":"1.0","source":{"id":"1611.04548","kind":"arxiv","version":1}},"canonical_sha256":"691b32f2fc75ae4656329d140f589d849f7c99d5e055f7b39685384630947b77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691b32f2fc75ae4656329d140f589d849f7c99d5e055f7b39685384630947b77","first_computed_at":"2026-05-18T00:59:12.814736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:12.814736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"61FtUFXLl47zK1RRGUeLE0Gq8WDmjWD8UQvDKI/gGF3F8r9sN+IV+YlI2KDrmNYqAm9isqTlsWBoZbh/Ag2JDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:12.815377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1a707f80d039f163ae8f2e3fcb35b49d58ead99ff23e1733ef3812ef02e53a8","sha256:d67a48e3935daf76b69bd87d20d89ecee4094bac76c9d3770189993ae26d3cb1"],"state_sha256":"ada583b22c1c5c2bd384782f91310fbfa455bc5332cc65b781b1c33e88a855f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnwUHs9H8YQn8SSZLd4xTchg1Wii0LObzSu6jCdjimRw7AQS3pJnPhxwGcLM4UFwmc0aM2NIVuV11OdwL07FCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:03:52.873936Z","bundle_sha256":"bf1b53923ba3aaeec07d2c8933e00b1e17203983c2eb511fdefa1190413901ed"}}