{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GV6RBH25CPAOGOCWXPQOIYIZO4","short_pith_number":"pith:GV6RBH25","canonical_record":{"source":{"id":"2307.08420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T12:07:50Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0d058eaeb98f137cf24be57ede0f4520b471fcce91a3e70e13869ec936f2a9e2","abstract_canon_sha256":"534675580bdde25215e73380d392f587e16376d642faa48ebf8b0baf5a25e001"},"schema_version":"1.0"},"canonical_sha256":"357d109f5d13c0e33856bbe0e461197722886cdff82812c561ed1e8ab8e293dc","source":{"kind":"arxiv","id":"2307.08420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.08420","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"arxiv_version","alias_value":"2307.08420v1","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08420","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"pith_short_12","alias_value":"GV6RBH25CPAO","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"GV6RBH25CPAOGOCW","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"GV6RBH25","created_at":"2026-07-05T06:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GV6RBH25CPAOGOCWXPQOIYIZO4","target":"record","payload":{"canonical_record":{"source":{"id":"2307.08420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T12:07:50Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0d058eaeb98f137cf24be57ede0f4520b471fcce91a3e70e13869ec936f2a9e2","abstract_canon_sha256":"534675580bdde25215e73380d392f587e16376d642faa48ebf8b0baf5a25e001"},"schema_version":"1.0"},"canonical_sha256":"357d109f5d13c0e33856bbe0e461197722886cdff82812c561ed1e8ab8e293dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:24.408829Z","signature_b64":"L2etK5Il88pfbSiTkPNg0Vqp6OAt7GfrgTfyHcYbvU0WBbeq1NX9ABgY5PKP+0P0i3xtBFkWOxcQFWBJpdveBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"357d109f5d13c0e33856bbe0e461197722886cdff82812c561ed1e8ab8e293dc","last_reissued_at":"2026-07-05T06:31:24.408294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:24.408294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.08420","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-05T06:31:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLdBAN6922ZVDdtxi+bl26zbns/ycXwnzAUmW75GrfQtIPX7YdjqkuL1YJm+gQ1BpDebNVX+sNXMpu/jTmtxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T13:40:57.164512Z"},"content_sha256":"9dc0e2b511d43874df9bda7c9a199b8a9dc4e200d80837f5827eca369d8635a9","schema_version":"1.0","event_id":"sha256:9dc0e2b511d43874df9bda7c9a199b8a9dc4e200d80837f5827eca369d8635a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GV6RBH25CPAOGOCWXPQOIYIZO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Flows in Parametric Graph Templates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Lukas Gianinazzi, Tal Ben-Nun, Torsten Hoefler, Yishai Oltchik","submitted_at":"2023-07-17T12:07:50Z","abstract_excerpt":"Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct parametric structures. This parametric graph template representation allows us to reason about the execution graph of a parallel program at a cost that only depends on the program size. We develop structurally-parametric polynomial-time algorithm variants of maximum flows. When the graph models a parallel loop program, the maximum flow provides a bound on the data movement during an execution of the program. By reasoni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08420","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/2307.08420/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-05T06:31:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34mX9BHv87WGwydfp6Wdb1AvuT4jb1lumrCpM4tzzLZMOiiqoS4BV/P4nre2KCP2UN3pBRGYSnTRsJG9GwyMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T13:40:57.164994Z"},"content_sha256":"b4d3c44f50882b116e0e33995e4b7590fb7ad50aa4c6091841eebbf9191501f0","schema_version":"1.0","event_id":"sha256:b4d3c44f50882b116e0e33995e4b7590fb7ad50aa4c6091841eebbf9191501f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GV6RBH25CPAOGOCWXPQOIYIZO4/bundle.json","state_url":"https://pith.science/pith/GV6RBH25CPAOGOCWXPQOIYIZO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GV6RBH25CPAOGOCWXPQOIYIZO4/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-07-31T13:40:57Z","links":{"resolver":"https://pith.science/pith/GV6RBH25CPAOGOCWXPQOIYIZO4","bundle":"https://pith.science/pith/GV6RBH25CPAOGOCWXPQOIYIZO4/bundle.json","state":"https://pith.science/pith/GV6RBH25CPAOGOCWXPQOIYIZO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GV6RBH25CPAOGOCWXPQOIYIZO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GV6RBH25CPAOGOCWXPQOIYIZO4","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":"534675580bdde25215e73380d392f587e16376d642faa48ebf8b0baf5a25e001","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T12:07:50Z","title_canon_sha256":"0d058eaeb98f137cf24be57ede0f4520b471fcce91a3e70e13869ec936f2a9e2"},"schema_version":"1.0","source":{"id":"2307.08420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.08420","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"arxiv_version","alias_value":"2307.08420v1","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08420","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"pith_short_12","alias_value":"GV6RBH25CPAO","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"GV6RBH25CPAOGOCW","created_at":"2026-07-05T06:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"GV6RBH25","created_at":"2026-07-05T06:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:b4d3c44f50882b116e0e33995e4b7590fb7ad50aa4c6091841eebbf9191501f0","target":"graph","created_at":"2026-07-05T06:31:24Z","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/2307.08420/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct parametric structures. This parametric graph template representation allows us to reason about the execution graph of a parallel program at a cost that only depends on the program size. We develop structurally-parametric polynomial-time algorithm variants of maximum flows. When the graph models a parallel loop program, the maximum flow provides a bound on the data movement during an execution of the program. By reasoni","authors_text":"Lukas Gianinazzi, Tal Ben-Nun, Torsten Hoefler, Yishai Oltchik","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T12:07:50Z","title":"Maximum Flows in Parametric Graph Templates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08420","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:9dc0e2b511d43874df9bda7c9a199b8a9dc4e200d80837f5827eca369d8635a9","target":"record","created_at":"2026-07-05T06:31:24Z","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":"534675580bdde25215e73380d392f587e16376d642faa48ebf8b0baf5a25e001","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-17T12:07:50Z","title_canon_sha256":"0d058eaeb98f137cf24be57ede0f4520b471fcce91a3e70e13869ec936f2a9e2"},"schema_version":"1.0","source":{"id":"2307.08420","kind":"arxiv","version":1}},"canonical_sha256":"357d109f5d13c0e33856bbe0e461197722886cdff82812c561ed1e8ab8e293dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"357d109f5d13c0e33856bbe0e461197722886cdff82812c561ed1e8ab8e293dc","first_computed_at":"2026-07-05T06:31:24.408294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:31:24.408294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L2etK5Il88pfbSiTkPNg0Vqp6OAt7GfrgTfyHcYbvU0WBbeq1NX9ABgY5PKP+0P0i3xtBFkWOxcQFWBJpdveBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:31:24.408829Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.08420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dc0e2b511d43874df9bda7c9a199b8a9dc4e200d80837f5827eca369d8635a9","sha256:b4d3c44f50882b116e0e33995e4b7590fb7ad50aa4c6091841eebbf9191501f0"],"state_sha256":"aff0d957089d67eb32593a72ac9fc7289ed173e9133178028aaef8ba5a521164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pxte+DPHojbymRzz0NnE198jqqpdr6wdxuP6x1+AvEIMOd51cOjGUk887WmRzPnEsoMbuZIjcjr13bmIP9BPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T13:40:57.170687Z","bundle_sha256":"7d9e8a437472f0e7d108b3acff3402f67260a022b0a299d4624aa67ca225557c"}}