{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:INEKS5ROGKRFNDVHLIVCIIG7PT","short_pith_number":"pith:INEKS5RO","canonical_record":{"source":{"id":"1902.00180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-01T04:44:11Z","cross_cats_sorted":["cs.SI","physics.data-an","stat.TH"],"title_canon_sha256":"939962afae501805b6831d07945a27c0d7cabe2cceb9fb9aa8b6b277a7f114f7","abstract_canon_sha256":"6f9d28e8b94ff70dd20fd75c617e46f7be9b1b8a1059b2cd0633a7c5b7279a86"},"schema_version":"1.0"},"canonical_sha256":"4348a9762e32a2568ea75a2a2420df7cf6c94d33eddc5b99ba89774c406962c3","source":{"kind":"arxiv","id":"1902.00180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00180","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00180v1","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00180","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"INEKS5ROGKRF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"INEKS5ROGKRFNDVH","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"INEKS5RO","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:INEKS5ROGKRFNDVHLIVCIIG7PT","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-01T04:44:11Z","cross_cats_sorted":["cs.SI","physics.data-an","stat.TH"],"title_canon_sha256":"939962afae501805b6831d07945a27c0d7cabe2cceb9fb9aa8b6b277a7f114f7","abstract_canon_sha256":"6f9d28e8b94ff70dd20fd75c617e46f7be9b1b8a1059b2cd0633a7c5b7279a86"},"schema_version":"1.0"},"canonical_sha256":"4348a9762e32a2568ea75a2a2420df7cf6c94d33eddc5b99ba89774c406962c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.079282Z","signature_b64":"d9q0UJ9b0Y2PxlhJoiOdqdzPdeXEpPwduGYmE+3uVfoPXTKO73mvEWhFtiFgoCXn2eSGqGXRV2xpU4fe5YkYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4348a9762e32a2568ea75a2a2420df7cf6c94d33eddc5b99ba89774c406962c3","last_reissued_at":"2026-05-17T23:54:58.078831Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.078831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00180","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-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPvdwH0HSWvzNOVKQf0e1mJf4KKjXFifO5wnC53QJ7ggyWUfKhaZXmRzEH+njlfSHCPz6wKssT5VR/A7fju5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:27:18.513095Z"},"content_sha256":"49b7cc33cb85c652ac97f14d33f52e76e22d49e8b35ecb5a071e6942b7ba9e72","schema_version":"1.0","event_id":"sha256:49b7cc33cb85c652ac97f14d33f52e76e22d49e8b35ecb5a071e6942b7ba9e72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:INEKS5ROGKRFNDVHLIVCIIG7PT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Markovian Monte Carlo on Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an","stat.TH"],"primary_cat":"math.ST","authors_text":"Chul-Ho Lee, Do Young Eun, Min Kang","submitted_at":"2019-02-01T04:44:11Z","abstract_excerpt":"Markov Chain Monte Carlo (MCMC) has been the de facto technique for sampling and inference of large graphs such as online social networks. At the heart of MCMC lies the ability to construct an ergodic Markov chain that attains any given stationary distribution $\\boldsymbol{\\pi}$, often in the form of random walks or crawling agents on the graph. Most of the works around MCMC, however, presume that the graph is undirected or has reciprocal edges, and become inapplicable when the graph is directed and non-reciprocal. Here we develop a similar framework for directed graphs, which we call Non-Mark"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00180","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-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBfg9dSwTYXcyjlv7HqmCPHVXtdOqc/GHOMDsRjlPHj7aArFm6orbiYYJAenXHUeiI7r5Q3MTfapbA/qXIvkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:27:18.513513Z"},"content_sha256":"db22fb1d32856390d10094e8b9a3d10bdf606dc9da0e232e75e790012f8e4acf","schema_version":"1.0","event_id":"sha256:db22fb1d32856390d10094e8b9a3d10bdf606dc9da0e232e75e790012f8e4acf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INEKS5ROGKRFNDVHLIVCIIG7PT/bundle.json","state_url":"https://pith.science/pith/INEKS5ROGKRFNDVHLIVCIIG7PT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INEKS5ROGKRFNDVHLIVCIIG7PT/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-27T18:27:18Z","links":{"resolver":"https://pith.science/pith/INEKS5ROGKRFNDVHLIVCIIG7PT","bundle":"https://pith.science/pith/INEKS5ROGKRFNDVHLIVCIIG7PT/bundle.json","state":"https://pith.science/pith/INEKS5ROGKRFNDVHLIVCIIG7PT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INEKS5ROGKRFNDVHLIVCIIG7PT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:INEKS5ROGKRFNDVHLIVCIIG7PT","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":"6f9d28e8b94ff70dd20fd75c617e46f7be9b1b8a1059b2cd0633a7c5b7279a86","cross_cats_sorted":["cs.SI","physics.data-an","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-01T04:44:11Z","title_canon_sha256":"939962afae501805b6831d07945a27c0d7cabe2cceb9fb9aa8b6b277a7f114f7"},"schema_version":"1.0","source":{"id":"1902.00180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00180","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00180v1","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00180","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"INEKS5ROGKRF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"INEKS5ROGKRFNDVH","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"INEKS5RO","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:db22fb1d32856390d10094e8b9a3d10bdf606dc9da0e232e75e790012f8e4acf","target":"graph","created_at":"2026-05-17T23:54:58Z","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":"Markov Chain Monte Carlo (MCMC) has been the de facto technique for sampling and inference of large graphs such as online social networks. At the heart of MCMC lies the ability to construct an ergodic Markov chain that attains any given stationary distribution $\\boldsymbol{\\pi}$, often in the form of random walks or crawling agents on the graph. Most of the works around MCMC, however, presume that the graph is undirected or has reciprocal edges, and become inapplicable when the graph is directed and non-reciprocal. Here we develop a similar framework for directed graphs, which we call Non-Mark","authors_text":"Chul-Ho Lee, Do Young Eun, Min Kang","cross_cats":["cs.SI","physics.data-an","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-01T04:44:11Z","title":"Non-Markovian Monte Carlo on Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00180","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:49b7cc33cb85c652ac97f14d33f52e76e22d49e8b35ecb5a071e6942b7ba9e72","target":"record","created_at":"2026-05-17T23:54:58Z","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":"6f9d28e8b94ff70dd20fd75c617e46f7be9b1b8a1059b2cd0633a7c5b7279a86","cross_cats_sorted":["cs.SI","physics.data-an","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-01T04:44:11Z","title_canon_sha256":"939962afae501805b6831d07945a27c0d7cabe2cceb9fb9aa8b6b277a7f114f7"},"schema_version":"1.0","source":{"id":"1902.00180","kind":"arxiv","version":1}},"canonical_sha256":"4348a9762e32a2568ea75a2a2420df7cf6c94d33eddc5b99ba89774c406962c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4348a9762e32a2568ea75a2a2420df7cf6c94d33eddc5b99ba89774c406962c3","first_computed_at":"2026-05-17T23:54:58.078831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:58.078831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d9q0UJ9b0Y2PxlhJoiOdqdzPdeXEpPwduGYmE+3uVfoPXTKO73mvEWhFtiFgoCXn2eSGqGXRV2xpU4fe5YkYDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:58.079282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49b7cc33cb85c652ac97f14d33f52e76e22d49e8b35ecb5a071e6942b7ba9e72","sha256:db22fb1d32856390d10094e8b9a3d10bdf606dc9da0e232e75e790012f8e4acf"],"state_sha256":"2e961e10739a40d071c1869ee9910980f3ff26722530fee0c6e9010c51cd38af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTjtr1ktaquopm8LZXDiSWh8lj0URrGsVSc866swm2JRN58XGJgAwg2QlwSdMybRXx47JWQe7p7fxY86kapcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:27:18.516444Z","bundle_sha256":"7ddf040116d24d40199a958f088f5ba8ab274dd5bd2e29453b515c28e63495fc"}}