{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MBJX47H5JGKGLF64PD7NI32JFO","short_pith_number":"pith:MBJX47H5","canonical_record":{"source":{"id":"2011.07001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-13T16:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"305e19477448f02e80da517c2cfdecd2bacc3c07e3e7d5127a1d830fd9f1991e","abstract_canon_sha256":"3114a1ccdb924cb4706fd9f4fbb8ce92d71ecfdbbaa68336ff78454a6207d5bd"},"schema_version":"1.0"},"canonical_sha256":"60537e7cfd49946597dc78fed46f492bbc228dce71475d559258b4b1b32bf590","source":{"kind":"arxiv","id":"2011.07001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.07001","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"2011.07001v1","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.07001","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"MBJX47H5JGKG","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_16","alias_value":"MBJX47H5JGKGLF64","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_8","alias_value":"MBJX47H5","created_at":"2026-07-05T01:51:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MBJX47H5JGKGLF64PD7NI32JFO","target":"record","payload":{"canonical_record":{"source":{"id":"2011.07001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-13T16:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"305e19477448f02e80da517c2cfdecd2bacc3c07e3e7d5127a1d830fd9f1991e","abstract_canon_sha256":"3114a1ccdb924cb4706fd9f4fbb8ce92d71ecfdbbaa68336ff78454a6207d5bd"},"schema_version":"1.0"},"canonical_sha256":"60537e7cfd49946597dc78fed46f492bbc228dce71475d559258b4b1b32bf590","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:26.863078Z","signature_b64":"PI/o4xlw5C02GvOn/+mCDYMYXmPwB9d8w5+vsySzawckuhEKB46koOma3Vfah4WDP/oeK6QT2rIuK6L4hpkhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60537e7cfd49946597dc78fed46f492bbc228dce71475d559258b4b1b32bf590","last_reissued_at":"2026-07-05T01:51:26.862657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:26.862657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.07001","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-05T01:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0vlctjkjxKVoKoJurstCSarzBKhgZ85KvzvKNU76P5u3UDoUjWyiqwN8gzRzXZwt4a8n0v2Dylb8396MAIGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T00:02:53.709211Z"},"content_sha256":"6b7cd63079d9a5823013d8b072dbbf1901026589ba168a3004001753ab3e6c36","schema_version":"1.0","event_id":"sha256:6b7cd63079d9a5823013d8b072dbbf1901026589ba168a3004001753ab3e6c36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MBJX47H5JGKGLF64PD7NI32JFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parametric Graph Templates: Properties and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lukas Gianinazzi, Tal Ben-Nun, Torsten Hoefler, Yishai Oltchik","submitted_at":"2020-11-13T16:31:33Z","abstract_excerpt":"Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, which are defined by templates that generate structure by way of repeated instantiation. We propose a class of parametric graph templates that can succinctly represent a wide variety of graphs. Using parametric graph templates, we develop structurally-parametric algorithm variants of maximum flow, minimum cut, and tree subgraph isomorphism. Our algorithms are polynomial time for maximum flow and minimum cut and are fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.07001","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/2011.07001/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-05T01:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S28T9CFM2dY77E0MphOFkQeQ5tIksW1JCg3d0GKNO38q/AVe9WX6CBkKJQifvK3XS6921mYam3BQ2cuOzwzyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T00:02:53.710173Z"},"content_sha256":"5a4adda14937dbd9667200baf77c4ef97a6293bad2d447fbd2774a92298ef4d2","schema_version":"1.0","event_id":"sha256:5a4adda14937dbd9667200baf77c4ef97a6293bad2d447fbd2774a92298ef4d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBJX47H5JGKGLF64PD7NI32JFO/bundle.json","state_url":"https://pith.science/pith/MBJX47H5JGKGLF64PD7NI32JFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBJX47H5JGKGLF64PD7NI32JFO/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-17T00:02:53Z","links":{"resolver":"https://pith.science/pith/MBJX47H5JGKGLF64PD7NI32JFO","bundle":"https://pith.science/pith/MBJX47H5JGKGLF64PD7NI32JFO/bundle.json","state":"https://pith.science/pith/MBJX47H5JGKGLF64PD7NI32JFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBJX47H5JGKGLF64PD7NI32JFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MBJX47H5JGKGLF64PD7NI32JFO","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":"3114a1ccdb924cb4706fd9f4fbb8ce92d71ecfdbbaa68336ff78454a6207d5bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-13T16:31:33Z","title_canon_sha256":"305e19477448f02e80da517c2cfdecd2bacc3c07e3e7d5127a1d830fd9f1991e"},"schema_version":"1.0","source":{"id":"2011.07001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.07001","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"2011.07001v1","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.07001","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"MBJX47H5JGKG","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_16","alias_value":"MBJX47H5JGKGLF64","created_at":"2026-07-05T01:51:26Z"},{"alias_kind":"pith_short_8","alias_value":"MBJX47H5","created_at":"2026-07-05T01:51:26Z"}],"graph_snapshots":[{"event_id":"sha256:5a4adda14937dbd9667200baf77c4ef97a6293bad2d447fbd2774a92298ef4d2","target":"graph","created_at":"2026-07-05T01:51:26Z","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/2011.07001/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, which are defined by templates that generate structure by way of repeated instantiation. We propose a class of parametric graph templates that can succinctly represent a wide variety of graphs. Using parametric graph templates, we develop structurally-parametric algorithm variants of maximum flow, minimum cut, and tree subgraph isomorphism. Our algorithms are polynomial time for maximum flow and minimum cut and are fi","authors_text":"Lukas Gianinazzi, Tal Ben-Nun, Torsten Hoefler, Yishai Oltchik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-13T16:31:33Z","title":"Parametric Graph Templates: Properties and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.07001","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:6b7cd63079d9a5823013d8b072dbbf1901026589ba168a3004001753ab3e6c36","target":"record","created_at":"2026-07-05T01:51:26Z","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":"3114a1ccdb924cb4706fd9f4fbb8ce92d71ecfdbbaa68336ff78454a6207d5bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-13T16:31:33Z","title_canon_sha256":"305e19477448f02e80da517c2cfdecd2bacc3c07e3e7d5127a1d830fd9f1991e"},"schema_version":"1.0","source":{"id":"2011.07001","kind":"arxiv","version":1}},"canonical_sha256":"60537e7cfd49946597dc78fed46f492bbc228dce71475d559258b4b1b32bf590","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60537e7cfd49946597dc78fed46f492bbc228dce71475d559258b4b1b32bf590","first_computed_at":"2026-07-05T01:51:26.862657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:26.862657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PI/o4xlw5C02GvOn/+mCDYMYXmPwB9d8w5+vsySzawckuhEKB46koOma3Vfah4WDP/oeK6QT2rIuK6L4hpkhAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:26.863078Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.07001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b7cd63079d9a5823013d8b072dbbf1901026589ba168a3004001753ab3e6c36","sha256:5a4adda14937dbd9667200baf77c4ef97a6293bad2d447fbd2774a92298ef4d2"],"state_sha256":"26958b5cbcf77929b36d21f680951cb61805176e7b4e181db9e6ed0fb223343c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WWbUR4ABBqxuhaNp5mEZM/TBZUmEFrnwAkSvTVYGDiet6mEb8YiwhuUSlB8kvlRrPr05U4R2x0jYbBzCQHa2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T00:02:53.719077Z","bundle_sha256":"fba8f54ed57bf8a5bdde96dd3e6582eb6c5a4cadebcd2cf7df034ad7e2aadbe8"}}