{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:DTP5RBKFXNWJQSNL5ROMLP4LIK","short_pith_number":"pith:DTP5RBKF","canonical_record":{"source":{"id":"0707.0093","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.HO","submitted_at":"2007-07-01T08:13:07Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"5634763de4db0f4f971b00e53f6bfbc721d32e1ee7ea0006041d2e256aec1b74","abstract_canon_sha256":"19d918c7befa0a9e7bfb54d4104641a72d88bfb8d49c4a6455bdc0ccee7213be"},"schema_version":"1.0"},"canonical_sha256":"1cdfd88545bb6c9849abec5cc5bf8b429fcd806151974444f20e09a9d5eb3dc6","source":{"kind":"arxiv","id":"0707.0093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.0093","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"0707.0093v1","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0093","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"DTP5RBKFXNWJ","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"pith_short_16","alias_value":"DTP5RBKFXNWJQSNL","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"pith_short_8","alias_value":"DTP5RBKF","created_at":"2026-07-04T15:02:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:DTP5RBKFXNWJQSNL5ROMLP4LIK","target":"record","payload":{"canonical_record":{"source":{"id":"0707.0093","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.HO","submitted_at":"2007-07-01T08:13:07Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"5634763de4db0f4f971b00e53f6bfbc721d32e1ee7ea0006041d2e256aec1b74","abstract_canon_sha256":"19d918c7befa0a9e7bfb54d4104641a72d88bfb8d49c4a6455bdc0ccee7213be"},"schema_version":"1.0"},"canonical_sha256":"1cdfd88545bb6c9849abec5cc5bf8b429fcd806151974444f20e09a9d5eb3dc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:33.724703Z","signature_b64":"dHNve+cvQIDfhw3AIwYwIaOyLPVg1ibAzJL6CAwdWAp00B6nIMvoVB6nWz8PqfkjLlzrwMmHak9mZ2xr7rYdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cdfd88545bb6c9849abec5cc5bf8b429fcd806151974444f20e09a9d5eb3dc6","last_reissued_at":"2026-07-04T15:02:33.724309Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:33.724309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0707.0093","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-04T15:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ebBPDrKGMxvwv2dmKO2rQNei0L6wurEG2o0/hP4pFjomGJUN8ldE6HLKyQ0fQ+rFyHiZh73PsXtGv4mr77mAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:46:02.507693Z"},"content_sha256":"76b78b084961f138096f62e53cb38d3c282e8c4b00f1be0273c5f02107ff009e","schema_version":"1.0","event_id":"sha256:76b78b084961f138096f62e53cb38d3c282e8c4b00f1be0273c5f02107ff009e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:DTP5RBKFXNWJQSNL5ROMLP4LIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum overhang","license":"","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.HO","authors_text":"Mike Paterson, Mikkel Thorup, Peter Winkler, Uri Zwick, Yuval Peres","submitted_at":"2007-07-01T08:13:07Z","abstract_excerpt":"How far can a stack of $n$ identical blocks be made to hang over the edge of a table? The question dates back to at least the middle of the 19th century and the answer to it was widely believed to be of order $\\log n$. Recently, Paterson and Zwick constructed $n$-block stacks with overhangs of order $n^{1/3}$, exponentially better than previously thought possible. We show here that order $n^{1/3}$ is indeed best possible, resolving the long-standing overhang problem up to a constant factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0093","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/0707.0093/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-04T15:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmEcNu0ymnytjV52+oqu9Cg9E4lcUijqKWulY2ZJh7oKPwYM2OGyLb+J2VbMxcbPoHl27TtsupE4a6KhTZBMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:46:02.508256Z"},"content_sha256":"c0aece92b0408f56cbb2159766f08f31808c43aa7ed0c235199fbf823789b9b4","schema_version":"1.0","event_id":"sha256:c0aece92b0408f56cbb2159766f08f31808c43aa7ed0c235199fbf823789b9b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTP5RBKFXNWJQSNL5ROMLP4LIK/bundle.json","state_url":"https://pith.science/pith/DTP5RBKFXNWJQSNL5ROMLP4LIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTP5RBKFXNWJQSNL5ROMLP4LIK/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:46:02Z","links":{"resolver":"https://pith.science/pith/DTP5RBKFXNWJQSNL5ROMLP4LIK","bundle":"https://pith.science/pith/DTP5RBKFXNWJQSNL5ROMLP4LIK/bundle.json","state":"https://pith.science/pith/DTP5RBKFXNWJQSNL5ROMLP4LIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTP5RBKFXNWJQSNL5ROMLP4LIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:DTP5RBKFXNWJQSNL5ROMLP4LIK","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":"19d918c7befa0a9e7bfb54d4104641a72d88bfb8d49c4a6455bdc0ccee7213be","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"","primary_cat":"math.HO","submitted_at":"2007-07-01T08:13:07Z","title_canon_sha256":"5634763de4db0f4f971b00e53f6bfbc721d32e1ee7ea0006041d2e256aec1b74"},"schema_version":"1.0","source":{"id":"0707.0093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.0093","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"0707.0093v1","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0093","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"DTP5RBKFXNWJ","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"pith_short_16","alias_value":"DTP5RBKFXNWJQSNL","created_at":"2026-07-04T15:02:33Z"},{"alias_kind":"pith_short_8","alias_value":"DTP5RBKF","created_at":"2026-07-04T15:02:33Z"}],"graph_snapshots":[{"event_id":"sha256:c0aece92b0408f56cbb2159766f08f31808c43aa7ed0c235199fbf823789b9b4","target":"graph","created_at":"2026-07-04T15:02:33Z","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/0707.0093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"How far can a stack of $n$ identical blocks be made to hang over the edge of a table? The question dates back to at least the middle of the 19th century and the answer to it was widely believed to be of order $\\log n$. Recently, Paterson and Zwick constructed $n$-block stacks with overhangs of order $n^{1/3}$, exponentially better than previously thought possible. We show here that order $n^{1/3}$ is indeed best possible, resolving the long-standing overhang problem up to a constant factor.","authors_text":"Mike Paterson, Mikkel Thorup, Peter Winkler, Uri Zwick, Yuval Peres","cross_cats":["math-ph","math.CO","math.MP"],"headline":"","license":"","primary_cat":"math.HO","submitted_at":"2007-07-01T08:13:07Z","title":"Maximum overhang"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0093","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:76b78b084961f138096f62e53cb38d3c282e8c4b00f1be0273c5f02107ff009e","target":"record","created_at":"2026-07-04T15:02:33Z","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":"19d918c7befa0a9e7bfb54d4104641a72d88bfb8d49c4a6455bdc0ccee7213be","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"","primary_cat":"math.HO","submitted_at":"2007-07-01T08:13:07Z","title_canon_sha256":"5634763de4db0f4f971b00e53f6bfbc721d32e1ee7ea0006041d2e256aec1b74"},"schema_version":"1.0","source":{"id":"0707.0093","kind":"arxiv","version":1}},"canonical_sha256":"1cdfd88545bb6c9849abec5cc5bf8b429fcd806151974444f20e09a9d5eb3dc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cdfd88545bb6c9849abec5cc5bf8b429fcd806151974444f20e09a9d5eb3dc6","first_computed_at":"2026-07-04T15:02:33.724309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:33.724309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dHNve+cvQIDfhw3AIwYwIaOyLPVg1ibAzJL6CAwdWAp00B6nIMvoVB6nWz8PqfkjLlzrwMmHak9mZ2xr7rYdDA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:33.724703Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.0093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76b78b084961f138096f62e53cb38d3c282e8c4b00f1be0273c5f02107ff009e","sha256:c0aece92b0408f56cbb2159766f08f31808c43aa7ed0c235199fbf823789b9b4"],"state_sha256":"d5a6f6c11564e23f1d8f6b55e9123e1aea24f2b0c00bdbe1740c6b9954567cf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWkIn3sEk/QrR5/PRyzZvv9aOSD4EWpegF+qBTRvrdctqA0hQlbW9aDNn03urg5yPKfxr+0VwgRNKAZTG7iNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:46:02.514045Z","bundle_sha256":"9791602870d1a09adb5f75140fb0beb8bd2d9d0d484d99bcbb6201084b321428"}}