{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HZUSOWZKVLHBGPDNWKZNALGZL2","short_pith_number":"pith:HZUSOWZK","canonical_record":{"source":{"id":"1605.03905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-12T17:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"233d1ad4c61293f0421512f3e3fca6cacc89b50e127bbb6907f81ca2516efdb3","abstract_canon_sha256":"0a72b1b78e3c5192ef4a806ca4a4382967472e7e4424bc36d5724d8a91e5ea6c"},"schema_version":"1.0"},"canonical_sha256":"3e69275b2aaace133c6db2b2d02cd95e806964643aba4d8a9fa53658f513f8b0","source":{"kind":"arxiv","id":"1605.03905","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03905","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03905v2","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03905","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"HZUSOWZKVLHB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HZUSOWZKVLHBGPDN","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HZUSOWZK","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HZUSOWZKVLHBGPDNWKZNALGZL2","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-12T17:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"233d1ad4c61293f0421512f3e3fca6cacc89b50e127bbb6907f81ca2516efdb3","abstract_canon_sha256":"0a72b1b78e3c5192ef4a806ca4a4382967472e7e4424bc36d5724d8a91e5ea6c"},"schema_version":"1.0"},"canonical_sha256":"3e69275b2aaace133c6db2b2d02cd95e806964643aba4d8a9fa53658f513f8b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:14.303618Z","signature_b64":"Alorv3ag5oh2VNW3BE/vpLpxJ4I4WLLhdN/ZkMMaUHqPtvmXeB9QfDClbKWDWljxvxKuevY0iY+xVWYpUwlnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e69275b2aaace133c6db2b2d02cd95e806964643aba4d8a9fa53658f513f8b0","last_reissued_at":"2026-05-18T00:19:14.303000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:14.303000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03905","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-18T00:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ca6QPOVmnXoZfbXjxbAeyNYwfxpFPiRbxZpmyyFQx1HY9JqQ1SvdU314Ir0OLsfCxcRSXMhxfMbxhJNakp/HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:12:31.692770Z"},"content_sha256":"e8ffd61d0c465ff0947ecae461d365d43c6fb91fe2552553f4988cdd0651a3ff","schema_version":"1.0","event_id":"sha256:e8ffd61d0c465ff0947ecae461d365d43c6fb91fe2552553f4988cdd0651a3ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HZUSOWZKVLHBGPDNWKZNALGZL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thin times and random times' decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anna Aksamit, Monique Jeanblanc, Tahir Choulli","submitted_at":"2016-05-12T17:28:27Z","abstract_excerpt":"The paper studies thin times which are random times whose graph is contained in a countable union of the graphs of stopping times with respect to a reference filtration $\\mathbb F$. We show that a generic random time can be decomposed into thin and thick parts, where the second is a random time avoiding all $\\mathbb F$-stopping times. Then, for a given random time $\\tau$, we introduce ${\\mathbb F}^\\tau$, the smallest right-continuous filtration containing $\\mathbb F$ and making $\\tau$ a stopping time, and we show that, for a thin time $\\tau$, each $\\mathbb F$-martingale is an ${\\mathbb F}^\\tau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03905","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-18T00:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jaITFbXP1VG66vlOyzpmJ35dNBP1zUtwXFKwgstNim4PDDKNzY6xNv7Rl9p8nVX0Vg0e54xUhUjr4RSliVcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:12:31.693113Z"},"content_sha256":"4b48d3d14393348c4c0dd87f3d963cce3d046f634e3a28be72582186422939eb","schema_version":"1.0","event_id":"sha256:4b48d3d14393348c4c0dd87f3d963cce3d046f634e3a28be72582186422939eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZUSOWZKVLHBGPDNWKZNALGZL2/bundle.json","state_url":"https://pith.science/pith/HZUSOWZKVLHBGPDNWKZNALGZL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZUSOWZKVLHBGPDNWKZNALGZL2/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-21T20:12:31Z","links":{"resolver":"https://pith.science/pith/HZUSOWZKVLHBGPDNWKZNALGZL2","bundle":"https://pith.science/pith/HZUSOWZKVLHBGPDNWKZNALGZL2/bundle.json","state":"https://pith.science/pith/HZUSOWZKVLHBGPDNWKZNALGZL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZUSOWZKVLHBGPDNWKZNALGZL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HZUSOWZKVLHBGPDNWKZNALGZL2","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":"0a72b1b78e3c5192ef4a806ca4a4382967472e7e4424bc36d5724d8a91e5ea6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-12T17:28:27Z","title_canon_sha256":"233d1ad4c61293f0421512f3e3fca6cacc89b50e127bbb6907f81ca2516efdb3"},"schema_version":"1.0","source":{"id":"1605.03905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03905","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03905v2","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03905","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"HZUSOWZKVLHB","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HZUSOWZKVLHBGPDN","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HZUSOWZK","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:4b48d3d14393348c4c0dd87f3d963cce3d046f634e3a28be72582186422939eb","target":"graph","created_at":"2026-05-18T00:19:14Z","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":"The paper studies thin times which are random times whose graph is contained in a countable union of the graphs of stopping times with respect to a reference filtration $\\mathbb F$. We show that a generic random time can be decomposed into thin and thick parts, where the second is a random time avoiding all $\\mathbb F$-stopping times. Then, for a given random time $\\tau$, we introduce ${\\mathbb F}^\\tau$, the smallest right-continuous filtration containing $\\mathbb F$ and making $\\tau$ a stopping time, and we show that, for a thin time $\\tau$, each $\\mathbb F$-martingale is an ${\\mathbb F}^\\tau","authors_text":"Anna Aksamit, Monique Jeanblanc, Tahir Choulli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-12T17:28:27Z","title":"Thin times and random times' decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03905","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:e8ffd61d0c465ff0947ecae461d365d43c6fb91fe2552553f4988cdd0651a3ff","target":"record","created_at":"2026-05-18T00:19:14Z","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":"0a72b1b78e3c5192ef4a806ca4a4382967472e7e4424bc36d5724d8a91e5ea6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-12T17:28:27Z","title_canon_sha256":"233d1ad4c61293f0421512f3e3fca6cacc89b50e127bbb6907f81ca2516efdb3"},"schema_version":"1.0","source":{"id":"1605.03905","kind":"arxiv","version":2}},"canonical_sha256":"3e69275b2aaace133c6db2b2d02cd95e806964643aba4d8a9fa53658f513f8b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e69275b2aaace133c6db2b2d02cd95e806964643aba4d8a9fa53658f513f8b0","first_computed_at":"2026-05-18T00:19:14.303000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:14.303000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Alorv3ag5oh2VNW3BE/vpLpxJ4I4WLLhdN/ZkMMaUHqPtvmXeB9QfDClbKWDWljxvxKuevY0iY+xVWYpUwlnBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:14.303618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8ffd61d0c465ff0947ecae461d365d43c6fb91fe2552553f4988cdd0651a3ff","sha256:4b48d3d14393348c4c0dd87f3d963cce3d046f634e3a28be72582186422939eb"],"state_sha256":"63bd6329ed6af8d24d785de1335f2bfa570d100532c7ae358820e25d57655bfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMlzW09BQhGJ0OFWWfSyB5eKXoQsYQn7LMZNCsSKOLhOhJxv2sLGpnmgqTy0WkDPzLS1gwqlnyfqvbwn1zMYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:12:31.694984Z","bundle_sha256":"ad5fba8b321c3f3572f1c27763e60586a79cc999f2fc9099d0f7586789c97838"}}