{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ","short_pith_number":"pith:7BMHQ2MD","canonical_record":{"source":{"id":"1304.7352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-04-27T09:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"1b3cc19518ade4af08c9f5911474263ef2b29e8811e5e2eba2f1d42f8258c957","abstract_canon_sha256":"e1cf3858130a6a049ba4ab69d54aecbf72571a984f7990a17cb1c4213ce55b73"},"schema_version":"1.0"},"canonical_sha256":"f858786983386c7743ec05446869567a7191384bc1116e4a9c1f7e9e7bfe956b","source":{"kind":"arxiv","id":"1304.7352","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7352","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7352v2","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7352","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"7BMHQ2MDHBWH","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7BMHQ2MDHBWHOQ7M","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7BMHQ2MD","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-04-27T09:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"1b3cc19518ade4af08c9f5911474263ef2b29e8811e5e2eba2f1d42f8258c957","abstract_canon_sha256":"e1cf3858130a6a049ba4ab69d54aecbf72571a984f7990a17cb1c4213ce55b73"},"schema_version":"1.0"},"canonical_sha256":"f858786983386c7743ec05446869567a7191384bc1116e4a9c1f7e9e7bfe956b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:33.290607Z","signature_b64":"7FZHslxo0QWd5fttjxVWcr2klbne4f6DnIIMz1Jz8jibrtcCBublFAIDRmUkydoPjam8Ls+1LADNnbdLuXT/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f858786983386c7743ec05446869567a7191384bc1116e4a9c1f7e9e7bfe956b","last_reissued_at":"2026-05-18T03:11:33.289796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:33.289796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7352","source_version":2,"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-18T03:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JieGuTTzjpN1JOmruG9AfWCaa2OT5tvphhLO7bHCJ9MEL+JvSFx/awLvVPCDHzQ1QZY0hWDdrqRvlOFSOEWHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:23:40.614467Z"},"content_sha256":"f5df125ba3c56321c8b69f56406402377eacc9d7a6fc9a892f2da8c65e58bf1b","schema_version":"1.0","event_id":"sha256:f5df125ba3c56321c8b69f56406402377eacc9d7a6fc9a892f2da8c65e58bf1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to estimate the number of self-avoiding walks over 10^100? Use random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Macoto Kikuchi, Nobu C. Shirai","submitted_at":"2013-04-27T09:41:23Z","abstract_excerpt":"Counting the number of N-step self-avoiding walks (SAWs) on a lattice is one of the most difficult problems of enumerative combinatorics. Once we give up calculating the exact number of them, however, we have a chance to apply powerful computational methods of statistical mechanics to this problem. In this paper, we develop a statistical enumeration method for SAWs using the multicanonical Monte Carlo method. A key part of this method is to expand the configuration space of SAWs to random walks, the exact number of which is known. Using this method, we estimate a number of N-step SAWs on a squ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7352","kind":"arxiv","version":2},"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-18T03:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/w3Sd/FYwVvwD4ocmdVT5nkdyD1MEEh7o/oGqYDcpkfbLX9P+pHcamZUfwO4WmYbIwpjjosMjQVL0G23GUiMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:23:40.614824Z"},"content_sha256":"cd8c5fdfbe64f338a4d48646d2152b90eea0318b101f987df4e904cc575f843d","schema_version":"1.0","event_id":"sha256:cd8c5fdfbe64f338a4d48646d2152b90eea0318b101f987df4e904cc575f843d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ/bundle.json","state_url":"https://pith.science/pith/7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ/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-06-11T10:23:40Z","links":{"resolver":"https://pith.science/pith/7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ","bundle":"https://pith.science/pith/7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ/bundle.json","state":"https://pith.science/pith/7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7BMHQ2MDHBWHOQ7MAVCGQ2KWPJ","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":"e1cf3858130a6a049ba4ab69d54aecbf72571a984f7990a17cb1c4213ce55b73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-04-27T09:41:23Z","title_canon_sha256":"1b3cc19518ade4af08c9f5911474263ef2b29e8811e5e2eba2f1d42f8258c957"},"schema_version":"1.0","source":{"id":"1304.7352","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7352","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7352v2","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7352","created_at":"2026-05-18T03:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"7BMHQ2MDHBWH","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7BMHQ2MDHBWHOQ7M","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7BMHQ2MD","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:cd8c5fdfbe64f338a4d48646d2152b90eea0318b101f987df4e904cc575f843d","target":"graph","created_at":"2026-05-18T03:11: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"},"paper":{"abstract_excerpt":"Counting the number of N-step self-avoiding walks (SAWs) on a lattice is one of the most difficult problems of enumerative combinatorics. Once we give up calculating the exact number of them, however, we have a chance to apply powerful computational methods of statistical mechanics to this problem. In this paper, we develop a statistical enumeration method for SAWs using the multicanonical Monte Carlo method. A key part of this method is to expand the configuration space of SAWs to random walks, the exact number of which is known. Using this method, we estimate a number of N-step SAWs on a squ","authors_text":"Macoto Kikuchi, Nobu C. Shirai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-04-27T09:41:23Z","title":"How to estimate the number of self-avoiding walks over 10^100? Use random walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7352","kind":"arxiv","version":2},"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:f5df125ba3c56321c8b69f56406402377eacc9d7a6fc9a892f2da8c65e58bf1b","target":"record","created_at":"2026-05-18T03:11: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":"e1cf3858130a6a049ba4ab69d54aecbf72571a984f7990a17cb1c4213ce55b73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2013-04-27T09:41:23Z","title_canon_sha256":"1b3cc19518ade4af08c9f5911474263ef2b29e8811e5e2eba2f1d42f8258c957"},"schema_version":"1.0","source":{"id":"1304.7352","kind":"arxiv","version":2}},"canonical_sha256":"f858786983386c7743ec05446869567a7191384bc1116e4a9c1f7e9e7bfe956b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f858786983386c7743ec05446869567a7191384bc1116e4a9c1f7e9e7bfe956b","first_computed_at":"2026-05-18T03:11:33.289796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:33.289796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7FZHslxo0QWd5fttjxVWcr2klbne4f6DnIIMz1Jz8jibrtcCBublFAIDRmUkydoPjam8Ls+1LADNnbdLuXT/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:33.290607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7352","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5df125ba3c56321c8b69f56406402377eacc9d7a6fc9a892f2da8c65e58bf1b","sha256:cd8c5fdfbe64f338a4d48646d2152b90eea0318b101f987df4e904cc575f843d"],"state_sha256":"fb0bcacb61d54fe86fc8ed05b6078d4943118bb21606d9e484594e8673381a24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZu4oDCgCWv83Z7eT2dzj4qRnuzdAyfKTNR8ba54lQsdldoFvDpXKGKDaMSZEVAxrjgpxlFaJXTKSdc0bvipAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:23:40.616863Z","bundle_sha256":"fcea9f5784d13b50ddc2dc2350bb82027c03583e09802e194ff0eb3399b1a6c4"}}