{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:H6ZLTU2WJL6ZAFQDQXCIHPA2OS","short_pith_number":"pith:H6ZLTU2W","canonical_record":{"source":{"id":"2502.06237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-02-10T08:16:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cfa340e16403731cef6dd7f12c0222de905eeaae5f808968775e091791290c49","abstract_canon_sha256":"ac5f9a81c8f09455d217d2b9fedc0a15c74b77dc666fe571979cfb9bf196e249"},"schema_version":"1.0"},"canonical_sha256":"3fb2b9d3564afd90160385c483bc1a74b53e27d6f6648c436c5ce05416ba3e2f","source":{"kind":"arxiv","id":"2502.06237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06237","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06237v1","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06237","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"pith_short_12","alias_value":"H6ZLTU2WJL6Z","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"pith_short_16","alias_value":"H6ZLTU2WJL6ZAFQD","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"pith_short_8","alias_value":"H6ZLTU2W","created_at":"2026-07-05T10:11:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:H6ZLTU2WJL6ZAFQDQXCIHPA2OS","target":"record","payload":{"canonical_record":{"source":{"id":"2502.06237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-02-10T08:16:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cfa340e16403731cef6dd7f12c0222de905eeaae5f808968775e091791290c49","abstract_canon_sha256":"ac5f9a81c8f09455d217d2b9fedc0a15c74b77dc666fe571979cfb9bf196e249"},"schema_version":"1.0"},"canonical_sha256":"3fb2b9d3564afd90160385c483bc1a74b53e27d6f6648c436c5ce05416ba3e2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:49.417215Z","signature_b64":"eercsTUkxqdckTgym2c6s4gPE4RrqfBtYc1rGH/yYxxiFL1Gx7mH4aNVzcodXIXsOzQYP5YlyhOi4i8CVi9gBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb2b9d3564afd90160385c483bc1a74b53e27d6f6648c436c5ce05416ba3e2f","last_reissued_at":"2026-07-05T10:11:49.416675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:49.416675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.06237","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-05T10:11:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9T+y4rFuG80dBzEzp/Q294thNOCyvKoWWHUGgXAv3PVnHr0TgMsqG3yX2yi/CNWvf/fg/BSQnP0cZzY/HhuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:26:28.605746Z"},"content_sha256":"485b60d3cebe50b013c1b95ebcc362f5bc01834b25dcb29dbbc6035ed16990a8","schema_version":"1.0","event_id":"sha256:485b60d3cebe50b013c1b95ebcc362f5bc01834b25dcb29dbbc6035ed16990a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:H6ZLTU2WJL6ZAFQDQXCIHPA2OS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum flow and self-avoiding walk on bunkbed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Pengfei Tang","submitted_at":"2025-02-10T08:16:11Z","abstract_excerpt":"We consider two combinatorial models on bunkbed graphs: maximum flow and self-avoiding walks. A bunkbed graph is defined as the Cartesian product $G\\times K_2$, where $G$ is a finite graph and $K_2$ is the complete graph on two vertices, labelled $0$ and $1$. For the maximum flow problem, we show that if the bunkbed graph $G\\times K_2$ has non-negative, reflection-symmetric edge capacities, then for any $u, v\\in V(G)$, the maximum flow strength from $(u,0)$ to $(v,0)$ in $G\\times K_2$ is at least as large as that from $(u,0)$ to $(v,1)$.\n  For the self-avoiding walk model on a bunkbed graph $G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06237","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/2502.06237/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-05T10:11:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9R6uYYFa9evzSNyFJUOXQJIcVXYd5+yv65qeV46mrUWuYMCnM8c4kZiG4ysxI0+lhGkD89XZutfxjbSpbe0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T04:26:28.606365Z"},"content_sha256":"0440a1712942390f8933534f5d5a4a9d83ce02dcad35545b19d3b6f8cfcb1c1a","schema_version":"1.0","event_id":"sha256:0440a1712942390f8933534f5d5a4a9d83ce02dcad35545b19d3b6f8cfcb1c1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6ZLTU2WJL6ZAFQDQXCIHPA2OS/bundle.json","state_url":"https://pith.science/pith/H6ZLTU2WJL6ZAFQDQXCIHPA2OS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6ZLTU2WJL6ZAFQDQXCIHPA2OS/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-20T04:26:28Z","links":{"resolver":"https://pith.science/pith/H6ZLTU2WJL6ZAFQDQXCIHPA2OS","bundle":"https://pith.science/pith/H6ZLTU2WJL6ZAFQDQXCIHPA2OS/bundle.json","state":"https://pith.science/pith/H6ZLTU2WJL6ZAFQDQXCIHPA2OS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6ZLTU2WJL6ZAFQDQXCIHPA2OS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:H6ZLTU2WJL6ZAFQDQXCIHPA2OS","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":"ac5f9a81c8f09455d217d2b9fedc0a15c74b77dc666fe571979cfb9bf196e249","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-02-10T08:16:11Z","title_canon_sha256":"cfa340e16403731cef6dd7f12c0222de905eeaae5f808968775e091791290c49"},"schema_version":"1.0","source":{"id":"2502.06237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06237","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06237v1","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06237","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"pith_short_12","alias_value":"H6ZLTU2WJL6Z","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"pith_short_16","alias_value":"H6ZLTU2WJL6ZAFQD","created_at":"2026-07-05T10:11:49Z"},{"alias_kind":"pith_short_8","alias_value":"H6ZLTU2W","created_at":"2026-07-05T10:11:49Z"}],"graph_snapshots":[{"event_id":"sha256:0440a1712942390f8933534f5d5a4a9d83ce02dcad35545b19d3b6f8cfcb1c1a","target":"graph","created_at":"2026-07-05T10:11:49Z","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/2502.06237/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider two combinatorial models on bunkbed graphs: maximum flow and self-avoiding walks. A bunkbed graph is defined as the Cartesian product $G\\times K_2$, where $G$ is a finite graph and $K_2$ is the complete graph on two vertices, labelled $0$ and $1$. For the maximum flow problem, we show that if the bunkbed graph $G\\times K_2$ has non-negative, reflection-symmetric edge capacities, then for any $u, v\\in V(G)$, the maximum flow strength from $(u,0)$ to $(v,0)$ in $G\\times K_2$ is at least as large as that from $(u,0)$ to $(v,1)$.\n  For the self-avoiding walk model on a bunkbed graph $G","authors_text":"Pengfei Tang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06237","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:485b60d3cebe50b013c1b95ebcc362f5bc01834b25dcb29dbbc6035ed16990a8","target":"record","created_at":"2026-07-05T10:11:49Z","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":"ac5f9a81c8f09455d217d2b9fedc0a15c74b77dc666fe571979cfb9bf196e249","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-02-10T08:16:11Z","title_canon_sha256":"cfa340e16403731cef6dd7f12c0222de905eeaae5f808968775e091791290c49"},"schema_version":"1.0","source":{"id":"2502.06237","kind":"arxiv","version":1}},"canonical_sha256":"3fb2b9d3564afd90160385c483bc1a74b53e27d6f6648c436c5ce05416ba3e2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fb2b9d3564afd90160385c483bc1a74b53e27d6f6648c436c5ce05416ba3e2f","first_computed_at":"2026-07-05T10:11:49.416675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:49.416675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eercsTUkxqdckTgym2c6s4gPE4RrqfBtYc1rGH/yYxxiFL1Gx7mH4aNVzcodXIXsOzQYP5YlyhOi4i8CVi9gBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:49.417215Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.06237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:485b60d3cebe50b013c1b95ebcc362f5bc01834b25dcb29dbbc6035ed16990a8","sha256:0440a1712942390f8933534f5d5a4a9d83ce02dcad35545b19d3b6f8cfcb1c1a"],"state_sha256":"add8e7465c4ee1cddbbfb3a7ffd9417ba93f912a7fb702d3229737eacc98db19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCblPoC0+TgE/CT9Pik6DHAFVZOJjYyI8KnWdJKd/YyrCvaU/uJ4z3hPsiAzZ6Mq43xzLpBlj+TMg9ibpLUODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T04:26:28.609282Z","bundle_sha256":"429ca2a520afe85e6b86782e9df187242ff1e987e0016881578533e42fd443f4"}}