{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:V4GQ4AUY3CVDFPCDY2DLGQ4AQP","short_pith_number":"pith:V4GQ4AUY","canonical_record":{"source":{"id":"2412.13127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T17:45:23Z","cross_cats_sorted":[],"title_canon_sha256":"3f84e85193c014b8e15ca8cb1769c99ba3570c4dba6c345770066504c5aaddee","abstract_canon_sha256":"3d1f0ca224f6b9afdca6b3b3580cfc4e1b237f87f7997bac09aaa2016edf203c"},"schema_version":"1.0"},"canonical_sha256":"af0d0e0298d8aa32bc43c686b3438083e2f3cda49f706be05e921e273ed8be51","source":{"kind":"arxiv","id":"2412.13127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13127","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13127v1","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13127","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"V4GQ4AUY3CVD","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_16","alias_value":"V4GQ4AUY3CVDFPCD","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_8","alias_value":"V4GQ4AUY","created_at":"2026-07-05T09:50:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:V4GQ4AUY3CVDFPCDY2DLGQ4AQP","target":"record","payload":{"canonical_record":{"source":{"id":"2412.13127","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T17:45:23Z","cross_cats_sorted":[],"title_canon_sha256":"3f84e85193c014b8e15ca8cb1769c99ba3570c4dba6c345770066504c5aaddee","abstract_canon_sha256":"3d1f0ca224f6b9afdca6b3b3580cfc4e1b237f87f7997bac09aaa2016edf203c"},"schema_version":"1.0"},"canonical_sha256":"af0d0e0298d8aa32bc43c686b3438083e2f3cda49f706be05e921e273ed8be51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:40.872004Z","signature_b64":"AmgMBsQMq7pmriCZHtTGXSKCMzKjAwHOk2wOsnwtLYQKIordepmIi9Mu0zYehqo9XUyBkba/4ZrXBbarHOtYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af0d0e0298d8aa32bc43c686b3438083e2f3cda49f706be05e921e273ed8be51","last_reissued_at":"2026-07-05T09:50:40.871332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:40.871332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.13127","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-07-05T09:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fuL6ZPfOLEPYIZ7jbfo3V6l/6fsAGIa5b2YFYjrLQsalygkUrRsvbseCK78B4FbUocA7wv1tXm+WQsJ3gFJjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:11:07.033777Z"},"content_sha256":"5382bc16ad75ca06d7e8e250a32227a3ac15df3613fb9551f4b3b061970aff8b","schema_version":"1.0","event_id":"sha256:5382bc16ad75ca06d7e8e250a32227a3ac15df3613fb9551f4b3b061970aff8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:V4GQ4AUY3CVDFPCDY2DLGQ4AQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Rigidity of Random Graphs in high-dimensional spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niv Peleg, Yuval Peled","submitted_at":"2024-12-17T17:45:23Z","abstract_excerpt":"We study the maximum dimension $d=d(n,p)$ for which an Erd\\H{o}s-R\\'enyi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\\log n/n,~C_*=2/(1-\\log 2)$ -- the point where the graph's minimum degree exceeds half its average degree. We show that if $p < (1-\\varepsilon)p_c $, then $d(n,p)$ is asymptotically almost surely (a.a.s.) equal to the minimum degree of $G(n,p)$. In contrast, if $p_c \\leq p = o(n^{-1/2}) $ then $d(n,p) $ is a.a.s. equal to $(1/2 + o(1))np$. The second result confirms, in this regime, a conjecture o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13127","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.13127/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nk4iA0AKX1AHcSsPOjgaUnEFySIz4kT+B0/z3x+abniMAklAvX/ke114lr2CFy+y1GzfYtn05HMMPRLQMzeuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:11:07.034301Z"},"content_sha256":"64c5960bfe2524f90a7ad4514472ce8e9d7c7e3348f858a553d8ecd8671143b5","schema_version":"1.0","event_id":"sha256:64c5960bfe2524f90a7ad4514472ce8e9d7c7e3348f858a553d8ecd8671143b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4GQ4AUY3CVDFPCDY2DLGQ4AQP/bundle.json","state_url":"https://pith.science/pith/V4GQ4AUY3CVDFPCDY2DLGQ4AQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4GQ4AUY3CVDFPCDY2DLGQ4AQP/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-08-05T03:11:07Z","links":{"resolver":"https://pith.science/pith/V4GQ4AUY3CVDFPCDY2DLGQ4AQP","bundle":"https://pith.science/pith/V4GQ4AUY3CVDFPCDY2DLGQ4AQP/bundle.json","state":"https://pith.science/pith/V4GQ4AUY3CVDFPCDY2DLGQ4AQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4GQ4AUY3CVDFPCDY2DLGQ4AQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:V4GQ4AUY3CVDFPCDY2DLGQ4AQP","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":"3d1f0ca224f6b9afdca6b3b3580cfc4e1b237f87f7997bac09aaa2016edf203c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T17:45:23Z","title_canon_sha256":"3f84e85193c014b8e15ca8cb1769c99ba3570c4dba6c345770066504c5aaddee"},"schema_version":"1.0","source":{"id":"2412.13127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13127","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13127v1","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13127","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"V4GQ4AUY3CVD","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_16","alias_value":"V4GQ4AUY3CVDFPCD","created_at":"2026-07-05T09:50:40Z"},{"alias_kind":"pith_short_8","alias_value":"V4GQ4AUY","created_at":"2026-07-05T09:50:40Z"}],"graph_snapshots":[{"event_id":"sha256:64c5960bfe2524f90a7ad4514472ce8e9d7c7e3348f858a553d8ecd8671143b5","target":"graph","created_at":"2026-07-05T09:50:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.13127/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the maximum dimension $d=d(n,p)$ for which an Erd\\H{o}s-R\\'enyi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\\log n/n,~C_*=2/(1-\\log 2)$ -- the point where the graph's minimum degree exceeds half its average degree. We show that if $p < (1-\\varepsilon)p_c $, then $d(n,p)$ is asymptotically almost surely (a.a.s.) equal to the minimum degree of $G(n,p)$. In contrast, if $p_c \\leq p = o(n^{-1/2}) $ then $d(n,p) $ is a.a.s. equal to $(1/2 + o(1))np$. The second result confirms, in this regime, a conjecture o","authors_text":"Niv Peleg, Yuval Peled","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T17:45:23Z","title":"On the Rigidity of Random Graphs in high-dimensional spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13127","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:5382bc16ad75ca06d7e8e250a32227a3ac15df3613fb9551f4b3b061970aff8b","target":"record","created_at":"2026-07-05T09:50:40Z","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":"3d1f0ca224f6b9afdca6b3b3580cfc4e1b237f87f7997bac09aaa2016edf203c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T17:45:23Z","title_canon_sha256":"3f84e85193c014b8e15ca8cb1769c99ba3570c4dba6c345770066504c5aaddee"},"schema_version":"1.0","source":{"id":"2412.13127","kind":"arxiv","version":1}},"canonical_sha256":"af0d0e0298d8aa32bc43c686b3438083e2f3cda49f706be05e921e273ed8be51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af0d0e0298d8aa32bc43c686b3438083e2f3cda49f706be05e921e273ed8be51","first_computed_at":"2026-07-05T09:50:40.871332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:40.871332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AmgMBsQMq7pmriCZHtTGXSKCMzKjAwHOk2wOsnwtLYQKIordepmIi9Mu0zYehqo9XUyBkba/4ZrXBbarHOtYAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:40.872004Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.13127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5382bc16ad75ca06d7e8e250a32227a3ac15df3613fb9551f4b3b061970aff8b","sha256:64c5960bfe2524f90a7ad4514472ce8e9d7c7e3348f858a553d8ecd8671143b5"],"state_sha256":"73261d47f8c358fb5f609dd4c61ea9f063101e6961172f9d0766cab4d192bf84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aU27MnjNKE0CH33VeYBGAgRJFoAi5ic6BWTyhNVyd9f4WHz1/L4TVOA88cEqJmb0qjqVt4CY9xSSq0uAepqQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:11:07.039771Z","bundle_sha256":"9cb46791cd8246a849d68e5d8eb35409dbf775bdea07362d4053882adfb64e7c"}}