{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3L3FTAPEM6OIIPCFJDJDKD3HE3","short_pith_number":"pith:3L3FTAPE","canonical_record":{"source":{"id":"1505.01189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-05T21:20:06Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"1dbed90e86a3b96f712e9b6ac67c7e9c2ed3e5bfe95674b90839ba23f9a8cc2f","abstract_canon_sha256":"5843568f41d742f232e5f7647dc4b6a918bd0b972553989b49a3694af4b7207e"},"schema_version":"1.0"},"canonical_sha256":"daf65981e4679c843c4548d2350f6726e6d75e3014ba5fdbd82ebcef1a0f9542","source":{"kind":"arxiv","id":"1505.01189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01189","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01189v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01189","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"3L3FTAPEM6OI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3L3FTAPEM6OIIPCF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3L3FTAPE","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3L3FTAPEM6OIIPCFJDJDKD3HE3","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-05T21:20:06Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"1dbed90e86a3b96f712e9b6ac67c7e9c2ed3e5bfe95674b90839ba23f9a8cc2f","abstract_canon_sha256":"5843568f41d742f232e5f7647dc4b6a918bd0b972553989b49a3694af4b7207e"},"schema_version":"1.0"},"canonical_sha256":"daf65981e4679c843c4548d2350f6726e6d75e3014ba5fdbd82ebcef1a0f9542","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:41.067094Z","signature_b64":"HcdehUTUnk0NA0+3gl0Nut1Y3eNXgGRqCYL5+7c9ElKs3QPih72mLn2LI7NFta14eONC7FV7JzPeA/DUc5k+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daf65981e4679c843c4548d2350f6726e6d75e3014ba5fdbd82ebcef1a0f9542","last_reissued_at":"2026-05-18T00:12:41.066491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:41.066491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01189","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:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvZtkH97U4R2cO5L+jWi6OWjc59ZcxCqNcD+yP2GKFGpLQ0pYUComFHPv4kuzK33L9GojgEowbrdeyTDHwgsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:06:46.704909Z"},"content_sha256":"d3bbf1d48afeacfd3ba205b616158117aa3fbb4d18bdba79d03402aa1f7c4e22","schema_version":"1.0","event_id":"sha256:d3bbf1d48afeacfd3ba205b616158117aa3fbb4d18bdba79d03402aa1f7c4e22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3L3FTAPEM6OIIPCFJDJDKD3HE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Rigidity of Sparse Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Jonathan Mosheiff, Nati Linial","submitted_at":"2015-05-05T21:20:06Z","abstract_excerpt":"A graph with a trivial automorphism group is said to be rigid. Wright proved that for $\\frac{\\log n}{n}+\\omega(\\frac 1n)\\leq p\\leq \\frac 12$ a random graph $G\\in G(n,p)$ is rigid whp. It is not hard to see that this lower bound is sharp and for $p<\\frac{(1-\\epsilon)\\log n}{n}$ with positive probability $\\text{aut}(G)$ is nontrivial. We show that in the sparser case $\\omega(\\frac 1 n)\\leq p\\leq \\frac{\\log n}{n}+\\omega(\\frac 1n)$, it holds whp that $G$'s $2$-core is rigid. We conclude that for all $p$, a graph in $G(n,p)$ is reconstrutible whp. In addition this yields for $\\omega(\\frac 1n)\\leq p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01189","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:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vloe/aNr82fn1YMmRU1n9Wxqt5ikBw0ZBZAsBfKwTNUbeGsnvfhNxUQXTLEE6TGj7Ltq9R/uUA0pFNa2F1LaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:06:46.705273Z"},"content_sha256":"e0194a60d0c12fdfd5604ea1a1d84387a3ff3c7c13c869d2345047900580aa8c","schema_version":"1.0","event_id":"sha256:e0194a60d0c12fdfd5604ea1a1d84387a3ff3c7c13c869d2345047900580aa8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3L3FTAPEM6OIIPCFJDJDKD3HE3/bundle.json","state_url":"https://pith.science/pith/3L3FTAPEM6OIIPCFJDJDKD3HE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3L3FTAPEM6OIIPCFJDJDKD3HE3/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-27T13:06:46Z","links":{"resolver":"https://pith.science/pith/3L3FTAPEM6OIIPCFJDJDKD3HE3","bundle":"https://pith.science/pith/3L3FTAPEM6OIIPCFJDJDKD3HE3/bundle.json","state":"https://pith.science/pith/3L3FTAPEM6OIIPCFJDJDKD3HE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3L3FTAPEM6OIIPCFJDJDKD3HE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3L3FTAPEM6OIIPCFJDJDKD3HE3","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":"5843568f41d742f232e5f7647dc4b6a918bd0b972553989b49a3694af4b7207e","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-05T21:20:06Z","title_canon_sha256":"1dbed90e86a3b96f712e9b6ac67c7e9c2ed3e5bfe95674b90839ba23f9a8cc2f"},"schema_version":"1.0","source":{"id":"1505.01189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01189","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01189v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01189","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"3L3FTAPEM6OI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3L3FTAPEM6OIIPCF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3L3FTAPE","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:e0194a60d0c12fdfd5604ea1a1d84387a3ff3c7c13c869d2345047900580aa8c","target":"graph","created_at":"2026-05-18T00:12:41Z","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":"A graph with a trivial automorphism group is said to be rigid. Wright proved that for $\\frac{\\log n}{n}+\\omega(\\frac 1n)\\leq p\\leq \\frac 12$ a random graph $G\\in G(n,p)$ is rigid whp. It is not hard to see that this lower bound is sharp and for $p<\\frac{(1-\\epsilon)\\log n}{n}$ with positive probability $\\text{aut}(G)$ is nontrivial. We show that in the sparser case $\\omega(\\frac 1 n)\\leq p\\leq \\frac{\\log n}{n}+\\omega(\\frac 1n)$, it holds whp that $G$'s $2$-core is rigid. We conclude that for all $p$, a graph in $G(n,p)$ is reconstrutible whp. In addition this yields for $\\omega(\\frac 1n)\\leq p","authors_text":"Jonathan Mosheiff, Nati Linial","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-05T21:20:06Z","title":"On the Rigidity of Sparse Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01189","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:d3bbf1d48afeacfd3ba205b616158117aa3fbb4d18bdba79d03402aa1f7c4e22","target":"record","created_at":"2026-05-18T00:12:41Z","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":"5843568f41d742f232e5f7647dc4b6a918bd0b972553989b49a3694af4b7207e","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-05T21:20:06Z","title_canon_sha256":"1dbed90e86a3b96f712e9b6ac67c7e9c2ed3e5bfe95674b90839ba23f9a8cc2f"},"schema_version":"1.0","source":{"id":"1505.01189","kind":"arxiv","version":1}},"canonical_sha256":"daf65981e4679c843c4548d2350f6726e6d75e3014ba5fdbd82ebcef1a0f9542","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daf65981e4679c843c4548d2350f6726e6d75e3014ba5fdbd82ebcef1a0f9542","first_computed_at":"2026-05-18T00:12:41.066491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:41.066491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HcdehUTUnk0NA0+3gl0Nut1Y3eNXgGRqCYL5+7c9ElKs3QPih72mLn2LI7NFta14eONC7FV7JzPeA/DUc5k+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:41.067094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3bbf1d48afeacfd3ba205b616158117aa3fbb4d18bdba79d03402aa1f7c4e22","sha256:e0194a60d0c12fdfd5604ea1a1d84387a3ff3c7c13c869d2345047900580aa8c"],"state_sha256":"699a3c41e2b44a8491df1d7c8d2c7e5de09a1779ce6cfd1c589101dda3ba2d92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkn4QrDoyIEzX0o5JXG6cU8LlW2MRl2IuW5iY8U+evXQGQOEx+0ma98ByFhUPzxNAsa3nFILC1172sp7vzgpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:06:46.707678Z","bundle_sha256":"ad1ee1635d133790233468467ab751855a8ab081970005001087a6858cf973cd"}}