{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:F6ZSCKQXRQP27JN34NI4HQQHOU","short_pith_number":"pith:F6ZSCKQX","canonical_record":{"source":{"id":"2406.11034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-06-16T18:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"4817696ec4700a2eaac6ad13fa25ffa5a5346124ba809a7ca1668d5fc5b31322","abstract_canon_sha256":"b0fc36ec0ea773a78ce117af670d8dcc541396e1a9809a8333ece9e62393a766"},"schema_version":"1.0"},"canonical_sha256":"2fb3212a178c1fafa5bbe351c3c207751c48e444a2b60efec4bcf4b983e9edbf","source":{"kind":"arxiv","id":"2406.11034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.11034","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"2406.11034v1","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11034","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"F6ZSCKQXRQP2","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"pith_short_16","alias_value":"F6ZSCKQXRQP27JN3","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"pith_short_8","alias_value":"F6ZSCKQX","created_at":"2026-07-05T08:32:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:F6ZSCKQXRQP27JN34NI4HQQHOU","target":"record","payload":{"canonical_record":{"source":{"id":"2406.11034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-06-16T18:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"4817696ec4700a2eaac6ad13fa25ffa5a5346124ba809a7ca1668d5fc5b31322","abstract_canon_sha256":"b0fc36ec0ea773a78ce117af670d8dcc541396e1a9809a8333ece9e62393a766"},"schema_version":"1.0"},"canonical_sha256":"2fb3212a178c1fafa5bbe351c3c207751c48e444a2b60efec4bcf4b983e9edbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:47.908859Z","signature_b64":"Spx1fsnFfVIMewPKqKqzC2/R7drLnK0z8nKzmYpqG0e6PGjqIwcpCuvCBYY19btTvetQ+kNd8qNZuR9Z9KAmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fb3212a178c1fafa5bbe351c3c207751c48e444a2b60efec4bcf4b983e9edbf","last_reissued_at":"2026-07-05T08:32:47.908395Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:47.908395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.11034","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-05T08:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1sUrPd0zqU9enbsneWev3xYB0I0xV6QdSRM6pRpKrfG8nk49Ti9TJeppF5rl2XkMMv9kG59DjwF3blyfddzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T11:01:32.849200Z"},"content_sha256":"1da5a9bdbe047905d8f2f0018f5c691948c59edbf92fcfe5745793c1ea861e25","schema_version":"1.0","event_id":"sha256:1da5a9bdbe047905d8f2f0018f5c691948c59edbf92fcfe5745793c1ea861e25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:F6ZSCKQXRQP27JN34NI4HQQHOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tightness for the Cover Time of Wired Planar Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Oren Louidor, Santiago Saglietti","submitted_at":"2024-06-16T18:09:26Z","abstract_excerpt":"We consider a continuous time simple random walk on a subset of the square lattice with wired boundary conditions: the walk transitions at unit edge rate on the graph obtained from the lattice closure of the subset by contracting the boundary into one vertex. We study the cover time of such walk, namely the time it takes for the walk to visit all vertices in the graph. Taking a sequence of subsets obtained as scaled lattice versions of a nice planar domain, we show that the square root of the cover time normalized by the size of the subset, is tight around $\\frac{1}{\\sqrt{\\pi}} \\log N - \\frac{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11034","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/2406.11034/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-05T08:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSBa50fUrB0R+/6+N5OGueb+YvGK/bP/I879x/1p0mg7CEz2BHdWU12OlzXcEtw2qvIYJGJHYdkDNX+sV+zBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T11:01:32.849574Z"},"content_sha256":"d0a585615e0f910b0a8734fc5f6a14238a08eacf7d8bfe803240e5a040d34e3b","schema_version":"1.0","event_id":"sha256:d0a585615e0f910b0a8734fc5f6a14238a08eacf7d8bfe803240e5a040d34e3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6ZSCKQXRQP27JN34NI4HQQHOU/bundle.json","state_url":"https://pith.science/pith/F6ZSCKQXRQP27JN34NI4HQQHOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6ZSCKQXRQP27JN34NI4HQQHOU/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-18T11:01:32Z","links":{"resolver":"https://pith.science/pith/F6ZSCKQXRQP27JN34NI4HQQHOU","bundle":"https://pith.science/pith/F6ZSCKQXRQP27JN34NI4HQQHOU/bundle.json","state":"https://pith.science/pith/F6ZSCKQXRQP27JN34NI4HQQHOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6ZSCKQXRQP27JN34NI4HQQHOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:F6ZSCKQXRQP27JN34NI4HQQHOU","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":"b0fc36ec0ea773a78ce117af670d8dcc541396e1a9809a8333ece9e62393a766","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-06-16T18:09:26Z","title_canon_sha256":"4817696ec4700a2eaac6ad13fa25ffa5a5346124ba809a7ca1668d5fc5b31322"},"schema_version":"1.0","source":{"id":"2406.11034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.11034","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"2406.11034v1","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11034","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"F6ZSCKQXRQP2","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"pith_short_16","alias_value":"F6ZSCKQXRQP27JN3","created_at":"2026-07-05T08:32:47Z"},{"alias_kind":"pith_short_8","alias_value":"F6ZSCKQX","created_at":"2026-07-05T08:32:47Z"}],"graph_snapshots":[{"event_id":"sha256:d0a585615e0f910b0a8734fc5f6a14238a08eacf7d8bfe803240e5a040d34e3b","target":"graph","created_at":"2026-07-05T08:32:47Z","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/2406.11034/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a continuous time simple random walk on a subset of the square lattice with wired boundary conditions: the walk transitions at unit edge rate on the graph obtained from the lattice closure of the subset by contracting the boundary into one vertex. We study the cover time of such walk, namely the time it takes for the walk to visit all vertices in the graph. Taking a sequence of subsets obtained as scaled lattice versions of a nice planar domain, we show that the square root of the cover time normalized by the size of the subset, is tight around $\\frac{1}{\\sqrt{\\pi}} \\log N - \\frac{","authors_text":"Oren Louidor, Santiago Saglietti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-06-16T18:09:26Z","title":"Tightness for the Cover Time of Wired Planar Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11034","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:1da5a9bdbe047905d8f2f0018f5c691948c59edbf92fcfe5745793c1ea861e25","target":"record","created_at":"2026-07-05T08:32:47Z","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":"b0fc36ec0ea773a78ce117af670d8dcc541396e1a9809a8333ece9e62393a766","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-06-16T18:09:26Z","title_canon_sha256":"4817696ec4700a2eaac6ad13fa25ffa5a5346124ba809a7ca1668d5fc5b31322"},"schema_version":"1.0","source":{"id":"2406.11034","kind":"arxiv","version":1}},"canonical_sha256":"2fb3212a178c1fafa5bbe351c3c207751c48e444a2b60efec4bcf4b983e9edbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fb3212a178c1fafa5bbe351c3c207751c48e444a2b60efec4bcf4b983e9edbf","first_computed_at":"2026-07-05T08:32:47.908395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:32:47.908395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Spx1fsnFfVIMewPKqKqzC2/R7drLnK0z8nKzmYpqG0e6PGjqIwcpCuvCBYY19btTvetQ+kNd8qNZuR9Z9KAmCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:32:47.908859Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.11034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1da5a9bdbe047905d8f2f0018f5c691948c59edbf92fcfe5745793c1ea861e25","sha256:d0a585615e0f910b0a8734fc5f6a14238a08eacf7d8bfe803240e5a040d34e3b"],"state_sha256":"bd7679e9cca9964c38f63f474c145e4aa31ec4306af7b674ccc1bb783fe5f1f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJNW16U+rU5x+260bB6TAoUVHAGvOJOo8jduwsqZ4bWFptNucDEhJ7yo65AktLdpgAeAh/8w/LzoYA3xoHwXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T11:01:32.853935Z","bundle_sha256":"3ee5f886646a3b21aa2604f1bb36bce5c59d250edcfb6997d6f94c9c0ee949b3"}}