{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XDRPJVE3UP7N4FHIP6BN4JBEPL","short_pith_number":"pith:XDRPJVE3","schema_version":"1.0","canonical_sha256":"b8e2f4d49ba3fede14e87f82de24247ac09c4bc2e3ceda69462bb7bd8285beb1","source":{"kind":"arxiv","id":"1901.10631","version":1},"attestation_state":"computed","paper":{"title":"Dense graphs have rigid parts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"J\\'ozsef Solymosi, Orit E. Raz","submitted_at":"2019-01-30T01:22:44Z","abstract_excerpt":"While the problem of determining whether an embedding of a graph $G$ in $\\mathbb{R}^2$ is {\\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\\it rigid} or not is still a hard task that usually requires ad hoc arguments. In this paper, we show that {\\it every} embedding (not necessarily generic) of a dense enough graph (concretely, a graph with at least $C_0n^{3/2}\\log n$ edges, for some absolute constant $C_0>0$), which satisfies some very mild general position requirements (no three vertices of $G$ are embedded to a common line), must have a subfra"},"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":"1901.10631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-30T01:22:44Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"f86c23b7ff37f4f2089eff89a851096e9fcdcba42f3b8802c9204ee3987b11c0","abstract_canon_sha256":"b02ad0d6dce54ba6c8f861f0d966f775dc14f9892afeb998c1046e9c2c569230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:06.438428Z","signature_b64":"2ThfYEu3fOOC3EyqFBNSIEwGxvxwzuBVUyL3WmXUjES3HEUfSTkrAmc9Xt2BdcMxW11nxzjGNTHjTrbf23MTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8e2f4d49ba3fede14e87f82de24247ac09c4bc2e3ceda69462bb7bd8285beb1","last_reissued_at":"2026-05-17T23:55:06.437746Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:06.437746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense graphs have rigid parts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"J\\'ozsef Solymosi, Orit E. Raz","submitted_at":"2019-01-30T01:22:44Z","abstract_excerpt":"While the problem of determining whether an embedding of a graph $G$ in $\\mathbb{R}^2$ is {\\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\\it rigid} or not is still a hard task that usually requires ad hoc arguments. In this paper, we show that {\\it every} embedding (not necessarily generic) of a dense enough graph (concretely, a graph with at least $C_0n^{3/2}\\log n$ edges, for some absolute constant $C_0>0$), which satisfies some very mild general position requirements (no three vertices of $G$ are embedded to a common line), must have a subfra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10631","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.10631","created_at":"2026-05-17T23:55:06.437842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10631v1","created_at":"2026-05-17T23:55:06.437842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10631","created_at":"2026-05-17T23:55:06.437842+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDRPJVE3UP7N","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDRPJVE3UP7N4FHI","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDRPJVE3","created_at":"2026-05-18T12:33:33.725879+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/XDRPJVE3UP7N4FHIP6BN4JBEPL","json":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL.json","graph_json":"https://pith.science/api/pith-number/XDRPJVE3UP7N4FHIP6BN4JBEPL/graph.json","events_json":"https://pith.science/api/pith-number/XDRPJVE3UP7N4FHIP6BN4JBEPL/events.json","paper":"https://pith.science/paper/XDRPJVE3"},"agent_actions":{"view_html":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL","download_json":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL.json","view_paper":"https://pith.science/paper/XDRPJVE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10631&json=true","fetch_graph":"https://pith.science/api/pith-number/XDRPJVE3UP7N4FHIP6BN4JBEPL/graph.json","fetch_events":"https://pith.science/api/pith-number/XDRPJVE3UP7N4FHIP6BN4JBEPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/action/storage_attestation","attest_author":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/action/author_attestation","sign_citation":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/action/citation_signature","submit_replication":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/action/replication_record"}},"created_at":"2026-05-17T23:55:06.437842+00:00","updated_at":"2026-05-17T23:55:06.437842+00:00"}