{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XDRPJVE3UP7N4FHIP6BN4JBEPL","short_pith_number":"pith:XDRPJVE3","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"},"canonical_sha256":"b8e2f4d49ba3fede14e87f82de24247ac09c4bc2e3ceda69462bb7bd8285beb1","source":{"kind":"arxiv","id":"1901.10631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10631","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10631v1","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10631","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"pith_short_12","alias_value":"XDRPJVE3UP7N","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XDRPJVE3UP7N4FHI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XDRPJVE3","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XDRPJVE3UP7N4FHIP6BN4JBEPL","target":"record","payload":{"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"},"canonical_sha256":"b8e2f4d49ba3fede14e87f82de24247ac09c4bc2e3ceda69462bb7bd8285beb1","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"},"source_kind":"arxiv","source_id":"1901.10631","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-17T23:55:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7dpfb2HpkPaqPGAHkeXJAtTIFU93KO/aRsTN+ZFpHxbmX4aM0nR1O6xJyBz3Kqas33l4l7ypz5XJLRXfhQcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:25:37.907923Z"},"content_sha256":"58a1530ddf757bebab9927721ebbe4aa8f974b229c4ae49f03ee6890e1556e8f","schema_version":"1.0","event_id":"sha256:58a1530ddf757bebab9927721ebbe4aa8f974b229c4ae49f03ee6890e1556e8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XDRPJVE3UP7N4FHIP6BN4JBEPL","target":"graph","payload":{"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"},"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-17T23:55:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OK9FWpsCH4IHUak8Uqx3G9y8kjaO1tVNLM/zHk9opS3aBKpajNz3FtAy1uwqo9hhTP4/oiH8bCbHoKNali62CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:25:37.908269Z"},"content_sha256":"1093989a2b1a12e94d0431a3186959ad4e468e54d25c612153ca41f6af7a7fbc","schema_version":"1.0","event_id":"sha256:1093989a2b1a12e94d0431a3186959ad4e468e54d25c612153ca41f6af7a7fbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/bundle.json","state_url":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/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-07-07T08:25:37Z","links":{"resolver":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL","bundle":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/bundle.json","state":"https://pith.science/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDRPJVE3UP7N4FHIP6BN4JBEPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XDRPJVE3UP7N4FHIP6BN4JBEPL","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":"b02ad0d6dce54ba6c8f861f0d966f775dc14f9892afeb998c1046e9c2c569230","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-30T01:22:44Z","title_canon_sha256":"f86c23b7ff37f4f2089eff89a851096e9fcdcba42f3b8802c9204ee3987b11c0"},"schema_version":"1.0","source":{"id":"1901.10631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10631","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10631v1","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10631","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"pith_short_12","alias_value":"XDRPJVE3UP7N","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XDRPJVE3UP7N4FHI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XDRPJVE3","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:1093989a2b1a12e94d0431a3186959ad4e468e54d25c612153ca41f6af7a7fbc","target":"graph","created_at":"2026-05-17T23:55:06Z","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":"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","authors_text":"J\\'ozsef Solymosi, Orit E. Raz","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-30T01:22:44Z","title":"Dense graphs have rigid parts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10631","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:58a1530ddf757bebab9927721ebbe4aa8f974b229c4ae49f03ee6890e1556e8f","target":"record","created_at":"2026-05-17T23:55:06Z","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":"b02ad0d6dce54ba6c8f861f0d966f775dc14f9892afeb998c1046e9c2c569230","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-30T01:22:44Z","title_canon_sha256":"f86c23b7ff37f4f2089eff89a851096e9fcdcba42f3b8802c9204ee3987b11c0"},"schema_version":"1.0","source":{"id":"1901.10631","kind":"arxiv","version":1}},"canonical_sha256":"b8e2f4d49ba3fede14e87f82de24247ac09c4bc2e3ceda69462bb7bd8285beb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8e2f4d49ba3fede14e87f82de24247ac09c4bc2e3ceda69462bb7bd8285beb1","first_computed_at":"2026-05-17T23:55:06.437746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:06.437746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ThfYEu3fOOC3EyqFBNSIEwGxvxwzuBVUyL3WmXUjES3HEUfSTkrAmc9Xt2BdcMxW11nxzjGNTHjTrbf23MTAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:06.438428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58a1530ddf757bebab9927721ebbe4aa8f974b229c4ae49f03ee6890e1556e8f","sha256:1093989a2b1a12e94d0431a3186959ad4e468e54d25c612153ca41f6af7a7fbc"],"state_sha256":"710b0f227017dc101a3f597fc17d9b56955b7981c80994baa0f87769459768b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnGWyoOSHDa2Jc4msJI2qk/dAL46GqmqJMmcjWwrGy9F+n3WTmzXhhJHvLQjuGKqcIs4/wJyJrQrDoXCaDJlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:25:37.910089Z","bundle_sha256":"d31ce4fa5f0074fae27ddd7483acd380fb84d478b7929777caede73e63a0ed8d"}}