{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QNJ2P2CN4Q2EXDFTF5DUPMBYBH","short_pith_number":"pith:QNJ2P2CN","schema_version":"1.0","canonical_sha256":"8353a7e84de4344b8cb32f4747b03809df014a88fd831bd54bd4bf40f246cadc","source":{"kind":"arxiv","id":"1202.1198","version":2},"attestation_state":"computed","paper":{"title":"A Helly-type theorem for semi-monotone sets and monotone maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO"],"primary_cat":"math.LO","authors_text":"Andrei Gabrielov, Nicolai Vorobjov, Saugata Basu","submitted_at":"2012-02-06T16:42:14Z","abstract_excerpt":"We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the closure of the graph of a monotone map is a generalization of a compact convex set. In a particular case of an identically constant function, such a graph is called a {\\em semi-monotone set}. Graphs of monotone maps are, generally, non-convex, and their intersections, unlike intersections of convex sets, can be topologically complicated. In particular, such an "},"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":"1202.1198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-02-06T16:42:14Z","cross_cats_sorted":["math.AG","math.CO"],"title_canon_sha256":"aed13929c1d04147368a0294270f74c104cf6558418a43747f99c4b25e4d730a","abstract_canon_sha256":"0f9da282882b59b7c55082dacf0aceb87ffcfc11832508859bce6b06c44ec138"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:45.521503Z","signature_b64":"nsWBRnG4Jvq0kkukeXs4zE1EV35oYfJRZfg75qSfYQbDxJp3oF51VEmmHF3Cb5heN2LpDPViH5gt/kDC/2ATAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8353a7e84de4344b8cb32f4747b03809df014a88fd831bd54bd4bf40f246cadc","last_reissued_at":"2026-05-18T03:15:45.520605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:45.520605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Helly-type theorem for semi-monotone sets and monotone maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO"],"primary_cat":"math.LO","authors_text":"Andrei Gabrielov, Nicolai Vorobjov, Saugata Basu","submitted_at":"2012-02-06T16:42:14Z","abstract_excerpt":"We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the closure of the graph of a monotone map is a generalization of a compact convex set. In a particular case of an identically constant function, such a graph is called a {\\em semi-monotone set}. Graphs of monotone maps are, generally, non-convex, and their intersections, unlike intersections of convex sets, can be topologically complicated. In particular, such an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1198","kind":"arxiv","version":2},"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":"1202.1198","created_at":"2026-05-18T03:15:45.520752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1198v2","created_at":"2026-05-18T03:15:45.520752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1198","created_at":"2026-05-18T03:15:45.520752+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNJ2P2CN4Q2E","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNJ2P2CN4Q2EXDFT","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNJ2P2CN","created_at":"2026-05-18T12:27:18.751474+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/QNJ2P2CN4Q2EXDFTF5DUPMBYBH","json":"https://pith.science/pith/QNJ2P2CN4Q2EXDFTF5DUPMBYBH.json","graph_json":"https://pith.science/api/pith-number/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/graph.json","events_json":"https://pith.science/api/pith-number/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/events.json","paper":"https://pith.science/paper/QNJ2P2CN"},"agent_actions":{"view_html":"https://pith.science/pith/QNJ2P2CN4Q2EXDFTF5DUPMBYBH","download_json":"https://pith.science/pith/QNJ2P2CN4Q2EXDFTF5DUPMBYBH.json","view_paper":"https://pith.science/paper/QNJ2P2CN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1198&json=true","fetch_graph":"https://pith.science/api/pith-number/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/graph.json","fetch_events":"https://pith.science/api/pith-number/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/action/storage_attestation","attest_author":"https://pith.science/pith/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/action/author_attestation","sign_citation":"https://pith.science/pith/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/action/citation_signature","submit_replication":"https://pith.science/pith/QNJ2P2CN4Q2EXDFTF5DUPMBYBH/action/replication_record"}},"created_at":"2026-05-18T03:15:45.520752+00:00","updated_at":"2026-05-18T03:15:45.520752+00:00"}