{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LBXT4RCU2GPP2SYAJBLI5LJW3Q","short_pith_number":"pith:LBXT4RCU","canonical_record":{"source":{"id":"1511.06609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2015-11-20T14:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"9ee229aed2dad82c7302f0c0a7dc46c183969d9de5c0f0e6277a2e1d272b944b","abstract_canon_sha256":"5c1980091b363f4512f2b70fa1c6c168089e278ef67b8e8307a49c3e726fda7b"},"schema_version":"1.0"},"canonical_sha256":"586f3e4454d19efd4b0048568ead36dc0a4aa17983989793f54e4ade02095393","source":{"kind":"arxiv","id":"1511.06609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06609","created_at":"2026-05-18T00:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06609v1","created_at":"2026-05-18T00:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06609","created_at":"2026-05-18T00:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"LBXT4RCU2GPP","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LBXT4RCU2GPP2SYA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LBXT4RCU","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LBXT4RCU2GPP2SYAJBLI5LJW3Q","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2015-11-20T14:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"9ee229aed2dad82c7302f0c0a7dc46c183969d9de5c0f0e6277a2e1d272b944b","abstract_canon_sha256":"5c1980091b363f4512f2b70fa1c6c168089e278ef67b8e8307a49c3e726fda7b"},"schema_version":"1.0"},"canonical_sha256":"586f3e4454d19efd4b0048568ead36dc0a4aa17983989793f54e4ade02095393","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:23.753723Z","signature_b64":"VU9VnK+UZ7ICuykjyEbyQij9KOxppc5EyrpTEq4ON+s0VcJYu/5Vl3UydBzLxdbcnodRDnJ1V0UcNDUisjpXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"586f3e4454d19efd4b0048568ead36dc0a4aa17983989793f54e4ade02095393","last_reissued_at":"2026-05-18T00:01:23.753346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:23.753346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06609","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:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJ1ikCFEIDmIbsML0WLorvpAVcse7QzUfJf/4aJ3DS2A4fUIOqccUJpmVCfJWqlGLcXm6j1/yJ1OZsddLVQWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:21:26.096969Z"},"content_sha256":"044cbf5a945ac3d33912fb0fa75a704b8e3a325ca8d4ef756e71d3ec0cd532db","schema_version":"1.0","event_id":"sha256:044cbf5a945ac3d33912fb0fa75a704b8e3a325ca8d4ef756e71d3ec0cd532db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LBXT4RCU2GPP2SYAJBLI5LJW3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the number of connected components for tropical prevarieties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alex Davydow, Dima Grigoriev","submitted_at":"2015-11-20T14:25:29Z","abstract_excerpt":"For a tropical prevariety in ${R}^n$ given by a system of $k$ tropical polynomials in $n$ variables with degrees at most $d$, we prove that its number of connected components is less than ${k+7n-1 \\choose 3n} \\cdot \\frac{d^{3n}}{k+n+1}$. On a number of $0$-dimensional connected components a better bound ${k+4n \\choose 3n} \\cdot \\frac{d^n}{k+n+1}$ is obtained, which extends the Bezout bound due to B.~Sturmfels from the the case $k=n$ to an arbitrary $k\\ge n$. Also we show that the latter bound is close to sharp, in particular, the number of connected components can depend on $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06609","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:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i04D6tNHQNtGFA0QUKsbN6MmPqIbNkqEEDPD+6GCCqM1zjmXlYeIVPdF7cTXC6d1QELDz+1ksdQkp/xMCS+rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:21:26.097654Z"},"content_sha256":"3b25581874d46fe420ef7f79df6b3b11c5871689588620418f4a807ee6944614","schema_version":"1.0","event_id":"sha256:3b25581874d46fe420ef7f79df6b3b11c5871689588620418f4a807ee6944614"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBXT4RCU2GPP2SYAJBLI5LJW3Q/bundle.json","state_url":"https://pith.science/pith/LBXT4RCU2GPP2SYAJBLI5LJW3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBXT4RCU2GPP2SYAJBLI5LJW3Q/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-05-31T17:21:26Z","links":{"resolver":"https://pith.science/pith/LBXT4RCU2GPP2SYAJBLI5LJW3Q","bundle":"https://pith.science/pith/LBXT4RCU2GPP2SYAJBLI5LJW3Q/bundle.json","state":"https://pith.science/pith/LBXT4RCU2GPP2SYAJBLI5LJW3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBXT4RCU2GPP2SYAJBLI5LJW3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LBXT4RCU2GPP2SYAJBLI5LJW3Q","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":"5c1980091b363f4512f2b70fa1c6c168089e278ef67b8e8307a49c3e726fda7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2015-11-20T14:25:29Z","title_canon_sha256":"9ee229aed2dad82c7302f0c0a7dc46c183969d9de5c0f0e6277a2e1d272b944b"},"schema_version":"1.0","source":{"id":"1511.06609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06609","created_at":"2026-05-18T00:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06609v1","created_at":"2026-05-18T00:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06609","created_at":"2026-05-18T00:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"LBXT4RCU2GPP","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LBXT4RCU2GPP2SYA","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LBXT4RCU","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:3b25581874d46fe420ef7f79df6b3b11c5871689588620418f4a807ee6944614","target":"graph","created_at":"2026-05-18T00:01:23Z","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":"For a tropical prevariety in ${R}^n$ given by a system of $k$ tropical polynomials in $n$ variables with degrees at most $d$, we prove that its number of connected components is less than ${k+7n-1 \\choose 3n} \\cdot \\frac{d^{3n}}{k+n+1}$. On a number of $0$-dimensional connected components a better bound ${k+4n \\choose 3n} \\cdot \\frac{d^n}{k+n+1}$ is obtained, which extends the Bezout bound due to B.~Sturmfels from the the case $k=n$ to an arbitrary $k\\ge n$. Also we show that the latter bound is close to sharp, in particular, the number of connected components can depend on $k$.","authors_text":"Alex Davydow, Dima Grigoriev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2015-11-20T14:25:29Z","title":"Bounds on the number of connected components for tropical prevarieties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06609","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:044cbf5a945ac3d33912fb0fa75a704b8e3a325ca8d4ef756e71d3ec0cd532db","target":"record","created_at":"2026-05-18T00:01:23Z","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":"5c1980091b363f4512f2b70fa1c6c168089e278ef67b8e8307a49c3e726fda7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2015-11-20T14:25:29Z","title_canon_sha256":"9ee229aed2dad82c7302f0c0a7dc46c183969d9de5c0f0e6277a2e1d272b944b"},"schema_version":"1.0","source":{"id":"1511.06609","kind":"arxiv","version":1}},"canonical_sha256":"586f3e4454d19efd4b0048568ead36dc0a4aa17983989793f54e4ade02095393","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"586f3e4454d19efd4b0048568ead36dc0a4aa17983989793f54e4ade02095393","first_computed_at":"2026-05-18T00:01:23.753346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:23.753346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VU9VnK+UZ7ICuykjyEbyQij9KOxppc5EyrpTEq4ON+s0VcJYu/5Vl3UydBzLxdbcnodRDnJ1V0UcNDUisjpXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:23.753723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:044cbf5a945ac3d33912fb0fa75a704b8e3a325ca8d4ef756e71d3ec0cd532db","sha256:3b25581874d46fe420ef7f79df6b3b11c5871689588620418f4a807ee6944614"],"state_sha256":"f82deb91132bf1e9fe0cdc1cbd0fd370415f39f7b92553fe52ccf13b10f487bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YeMDAqntJEaM4UhJKke6AQZaVurqy8IL1ao2EXtfEC5DqWc05GlZe6eCoxGsOTW4mE0OLbOP2R8DnsACmzz0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:21:26.101396Z","bundle_sha256":"f256d60e216c918d549c8b89c8562da814d2ae8c4473387f43ae44626e0ac5fb"}}