{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KOZDXB3EZMVDDKHDYYWOBNDEPG","short_pith_number":"pith:KOZDXB3E","canonical_record":{"source":{"id":"1503.07705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T12:29:43Z","cross_cats_sorted":["cs.DM","math.AC"],"title_canon_sha256":"4dfb5ecc8038edb7cdd7fb11ad9ab5a71e4748f40c0da5baa12b4fb67bf1591a","abstract_canon_sha256":"e9e010202505fbb62c9c4d6c5c4cd887994be41e450a0df92197015df75f7f49"},"schema_version":"1.0"},"canonical_sha256":"53b23b8764cb2a31a8e3c62ce0b464799490c23f526e9cf88eb7a3a986dddd5e","source":{"kind":"arxiv","id":"1503.07705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07705","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07705v1","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07705","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"KOZDXB3EZMVD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KOZDXB3EZMVDDKHD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KOZDXB3E","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KOZDXB3EZMVDDKHDYYWOBNDEPG","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T12:29:43Z","cross_cats_sorted":["cs.DM","math.AC"],"title_canon_sha256":"4dfb5ecc8038edb7cdd7fb11ad9ab5a71e4748f40c0da5baa12b4fb67bf1591a","abstract_canon_sha256":"e9e010202505fbb62c9c4d6c5c4cd887994be41e450a0df92197015df75f7f49"},"schema_version":"1.0"},"canonical_sha256":"53b23b8764cb2a31a8e3c62ce0b464799490c23f526e9cf88eb7a3a986dddd5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:53.303352Z","signature_b64":"IKraVD7O+dkp2gGenJyzq0RuMY4uTEMf9swleVdLQTAt18zzqcs/Ou9cp6VZmBFGNSkJO/hELuhhoiQmMJiwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53b23b8764cb2a31a8e3c62ce0b464799490c23f526e9cf88eb7a3a986dddd5e","last_reissued_at":"2026-05-18T00:52:53.302599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:53.302599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07705","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:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NS5u40kms5bAUcFc3naI3Gleivc9n0lPNWRsypyenepieBhxSvqehT7zvsqBHRSzaPhcmz50xujmQ8k3SZkKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T07:30:32.240659Z"},"content_sha256":"7fbaa9471cbce53ffba32277d51b8e9cc676101b1b58e39702383ebe71bca814","schema_version":"1.0","event_id":"sha256:7fbaa9471cbce53ffba32277d51b8e9cc676101b1b58e39702383ebe71bca814"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KOZDXB3EZMVDDKHDYYWOBNDEPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Log-concavity and lower bounds for arithmetic circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.AC"],"primary_cat":"cs.CC","authors_text":"Ignacio Garc\\'ia-Marco (LIP), Pascal Koiran (LIP), S\\'ebastien Tavenas","submitted_at":"2015-03-26T12:29:43Z","abstract_excerpt":"One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \\sum\\_{i = 0}^d a\\_i X^i \\in \\mathbb{R}^+[X]$ be a polynomial satisfying the log-concavity condition $a\\_i^2 \\textgreater{} \\tau a\\_{i-1}a\\_{i+1}$ for every $i \\in \\{1,\\ldots,d-1\\},$ where $\\tau \\textgreater{} 0$. Whenever $f$ can be written under the form $f = \\sum\\_{i = 1}^k \\prod\\_{j = 1}^m f\\_{i,j}$ where the polynomials $f\\_{i,j}$ have at most $t$ monomials, it is clear that $d \\leq k t^m$. Assuming that the $f\\_{i,j}$ have only "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07705","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:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fAQEjlRvrfLxUtWb+7AuieLYbnv0aH9757vUGL0xhj8zUcEsK4fCF4y7Gub+o49yWUfO400CAAyXkfTzyLffBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T07:30:32.241001Z"},"content_sha256":"8706bb2704d52d904c8e7caa8a3aaa9caa44daf3cbbb6cc217aaba0e43b21bd3","schema_version":"1.0","event_id":"sha256:8706bb2704d52d904c8e7caa8a3aaa9caa44daf3cbbb6cc217aaba0e43b21bd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOZDXB3EZMVDDKHDYYWOBNDEPG/bundle.json","state_url":"https://pith.science/pith/KOZDXB3EZMVDDKHDYYWOBNDEPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOZDXB3EZMVDDKHDYYWOBNDEPG/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-26T07:30:32Z","links":{"resolver":"https://pith.science/pith/KOZDXB3EZMVDDKHDYYWOBNDEPG","bundle":"https://pith.science/pith/KOZDXB3EZMVDDKHDYYWOBNDEPG/bundle.json","state":"https://pith.science/pith/KOZDXB3EZMVDDKHDYYWOBNDEPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOZDXB3EZMVDDKHDYYWOBNDEPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KOZDXB3EZMVDDKHDYYWOBNDEPG","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":"e9e010202505fbb62c9c4d6c5c4cd887994be41e450a0df92197015df75f7f49","cross_cats_sorted":["cs.DM","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T12:29:43Z","title_canon_sha256":"4dfb5ecc8038edb7cdd7fb11ad9ab5a71e4748f40c0da5baa12b4fb67bf1591a"},"schema_version":"1.0","source":{"id":"1503.07705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07705","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07705v1","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07705","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"KOZDXB3EZMVD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KOZDXB3EZMVDDKHD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KOZDXB3E","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:8706bb2704d52d904c8e7caa8a3aaa9caa44daf3cbbb6cc217aaba0e43b21bd3","target":"graph","created_at":"2026-05-18T00:52:53Z","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":"One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \\sum\\_{i = 0}^d a\\_i X^i \\in \\mathbb{R}^+[X]$ be a polynomial satisfying the log-concavity condition $a\\_i^2 \\textgreater{} \\tau a\\_{i-1}a\\_{i+1}$ for every $i \\in \\{1,\\ldots,d-1\\},$ where $\\tau \\textgreater{} 0$. Whenever $f$ can be written under the form $f = \\sum\\_{i = 1}^k \\prod\\_{j = 1}^m f\\_{i,j}$ where the polynomials $f\\_{i,j}$ have at most $t$ monomials, it is clear that $d \\leq k t^m$. Assuming that the $f\\_{i,j}$ have only ","authors_text":"Ignacio Garc\\'ia-Marco (LIP), Pascal Koiran (LIP), S\\'ebastien Tavenas","cross_cats":["cs.DM","math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T12:29:43Z","title":"Log-concavity and lower bounds for arithmetic circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07705","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:7fbaa9471cbce53ffba32277d51b8e9cc676101b1b58e39702383ebe71bca814","target":"record","created_at":"2026-05-18T00:52:53Z","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":"e9e010202505fbb62c9c4d6c5c4cd887994be41e450a0df92197015df75f7f49","cross_cats_sorted":["cs.DM","math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T12:29:43Z","title_canon_sha256":"4dfb5ecc8038edb7cdd7fb11ad9ab5a71e4748f40c0da5baa12b4fb67bf1591a"},"schema_version":"1.0","source":{"id":"1503.07705","kind":"arxiv","version":1}},"canonical_sha256":"53b23b8764cb2a31a8e3c62ce0b464799490c23f526e9cf88eb7a3a986dddd5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53b23b8764cb2a31a8e3c62ce0b464799490c23f526e9cf88eb7a3a986dddd5e","first_computed_at":"2026-05-18T00:52:53.302599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:53.302599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IKraVD7O+dkp2gGenJyzq0RuMY4uTEMf9swleVdLQTAt18zzqcs/Ou9cp6VZmBFGNSkJO/hELuhhoiQmMJiwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:53.303352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fbaa9471cbce53ffba32277d51b8e9cc676101b1b58e39702383ebe71bca814","sha256:8706bb2704d52d904c8e7caa8a3aaa9caa44daf3cbbb6cc217aaba0e43b21bd3"],"state_sha256":"ee1b5f268176beb8ba0fc117d2ef88085cf71969ba2348c71aa26f12e9a808ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdIlNFegdnPLi6s8h4q+RxWDE49VzlqRwCqUxQ7Qx7vQd1daRtdi6+2BOnXNxrbej5Zxw4V2obyUyHB2EDiDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T07:30:32.242871Z","bundle_sha256":"4a96bdf0cbfbc3b7dc8e4e1c6a6e1492beaf06a26508b5f38868329c175f6b1e"}}