{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HAL4RVOXLDML4WOLIP7XT5CHDB","short_pith_number":"pith:HAL4RVOX","canonical_record":{"source":{"id":"2106.08500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-06-16T00:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"221dfe5d830b62a97b9ba3260e83952d8033e1b10abde646eed035e3d603091e","abstract_canon_sha256":"bf2cfee662292ca22e7558b28f07e37a15fb929697a06a0aa5520ab7f64256ca"},"schema_version":"1.0"},"canonical_sha256":"3817c8d5d758d8be59cb43ff79f447184ba412ddd69fa641d766bb06e645b90f","source":{"kind":"arxiv","id":"2106.08500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.08500","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"2106.08500v1","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08500","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"HAL4RVOXLDML","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"pith_short_16","alias_value":"HAL4RVOXLDML4WOL","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"pith_short_8","alias_value":"HAL4RVOX","created_at":"2026-07-05T02:49:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HAL4RVOXLDML4WOLIP7XT5CHDB","target":"record","payload":{"canonical_record":{"source":{"id":"2106.08500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-06-16T00:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"221dfe5d830b62a97b9ba3260e83952d8033e1b10abde646eed035e3d603091e","abstract_canon_sha256":"bf2cfee662292ca22e7558b28f07e37a15fb929697a06a0aa5520ab7f64256ca"},"schema_version":"1.0"},"canonical_sha256":"3817c8d5d758d8be59cb43ff79f447184ba412ddd69fa641d766bb06e645b90f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:58.607654Z","signature_b64":"ZvJeulCpr4JNSW1Xm3/D8njtg/PFbowFJb0yiN+/Z/Ul6PdhBPIMk9WS3XunpkPXbaZHCz+wfFJoiv0Ub2gJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3817c8d5d758d8be59cb43ff79f447184ba412ddd69fa641d766bb06e645b90f","last_reissued_at":"2026-07-05T02:49:58.607199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:58.607199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.08500","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-05T02:49:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2EQK6zvqOKoYaeTrlyxDJgfqB6OfG1V7hsnti1joPPvdzuicem8txPzOcHjeY+wOOtdculh8um+80BKt3P9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T23:12:50.780915Z"},"content_sha256":"d74f22f0df76787cf91154da2ad327694801372e25db7dc5ec99325382a330a3","schema_version":"1.0","event_id":"sha256:d74f22f0df76787cf91154da2ad327694801372e25db7dc5ec99325382a330a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HAL4RVOXLDML4WOLIP7XT5CHDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Graph Transformer Networks with Graph-based Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abhik Seal, Brian Martin, Gurbinder Gill, Keshav Pingali, Loc Hoang, Roshan Dathathri, Udit Agarwal","submitted_at":"2021-06-16T00:54:24Z","abstract_excerpt":"Graph transformer networks (GTN) are a variant of graph convolutional networks (GCN) that are targeted to heterogeneous graphs in which nodes and edges have associated type information that can be exploited to improve inference accuracy. GTNs learn important metapaths in the graph, create weighted edges for these metapaths, and use the resulting graph in a GCN. Currently, the only available implementation of GTNs uses dense matrix multiplication to find metapaths. Unfortunately, the space overhead of this approach can be large, so in practice it is used only for small graphs. In addition, the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08500","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/2106.08500/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-05T02:49:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZKlsia3dlPEl4kD/ogeg1YRybaq8qY6MnyQn313yR3q4cnMAct9QsvX1gtEwp8a53J/iJ3AxdegEB/zCcKRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T23:12:50.781295Z"},"content_sha256":"6d3a864c612ff523b60054c6becf5c1eafb77eeaf55d15448e38390aa2d8b8b0","schema_version":"1.0","event_id":"sha256:6d3a864c612ff523b60054c6becf5c1eafb77eeaf55d15448e38390aa2d8b8b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAL4RVOXLDML4WOLIP7XT5CHDB/bundle.json","state_url":"https://pith.science/pith/HAL4RVOXLDML4WOLIP7XT5CHDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAL4RVOXLDML4WOLIP7XT5CHDB/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-08T23:12:50Z","links":{"resolver":"https://pith.science/pith/HAL4RVOXLDML4WOLIP7XT5CHDB","bundle":"https://pith.science/pith/HAL4RVOXLDML4WOLIP7XT5CHDB/bundle.json","state":"https://pith.science/pith/HAL4RVOXLDML4WOLIP7XT5CHDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAL4RVOXLDML4WOLIP7XT5CHDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HAL4RVOXLDML4WOLIP7XT5CHDB","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":"bf2cfee662292ca22e7558b28f07e37a15fb929697a06a0aa5520ab7f64256ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-06-16T00:54:24Z","title_canon_sha256":"221dfe5d830b62a97b9ba3260e83952d8033e1b10abde646eed035e3d603091e"},"schema_version":"1.0","source":{"id":"2106.08500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.08500","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"2106.08500v1","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08500","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"HAL4RVOXLDML","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"pith_short_16","alias_value":"HAL4RVOXLDML4WOL","created_at":"2026-07-05T02:49:58Z"},{"alias_kind":"pith_short_8","alias_value":"HAL4RVOX","created_at":"2026-07-05T02:49:58Z"}],"graph_snapshots":[{"event_id":"sha256:6d3a864c612ff523b60054c6becf5c1eafb77eeaf55d15448e38390aa2d8b8b0","target":"graph","created_at":"2026-07-05T02:49: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.08500/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph transformer networks (GTN) are a variant of graph convolutional networks (GCN) that are targeted to heterogeneous graphs in which nodes and edges have associated type information that can be exploited to improve inference accuracy. GTNs learn important metapaths in the graph, create weighted edges for these metapaths, and use the resulting graph in a GCN. Currently, the only available implementation of GTNs uses dense matrix multiplication to find metapaths. Unfortunately, the space overhead of this approach can be large, so in practice it is used only for small graphs. In addition, the ","authors_text":"Abhik Seal, Brian Martin, Gurbinder Gill, Keshav Pingali, Loc Hoang, Roshan Dathathri, Udit Agarwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-06-16T00:54:24Z","title":"Optimizing Graph Transformer Networks with Graph-based Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08500","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:d74f22f0df76787cf91154da2ad327694801372e25db7dc5ec99325382a330a3","target":"record","created_at":"2026-07-05T02:49: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":"bf2cfee662292ca22e7558b28f07e37a15fb929697a06a0aa5520ab7f64256ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-06-16T00:54:24Z","title_canon_sha256":"221dfe5d830b62a97b9ba3260e83952d8033e1b10abde646eed035e3d603091e"},"schema_version":"1.0","source":{"id":"2106.08500","kind":"arxiv","version":1}},"canonical_sha256":"3817c8d5d758d8be59cb43ff79f447184ba412ddd69fa641d766bb06e645b90f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3817c8d5d758d8be59cb43ff79f447184ba412ddd69fa641d766bb06e645b90f","first_computed_at":"2026-07-05T02:49:58.607199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:49:58.607199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZvJeulCpr4JNSW1Xm3/D8njtg/PFbowFJb0yiN+/Z/Ul6PdhBPIMk9WS3XunpkPXbaZHCz+wfFJoiv0Ub2gJAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:49:58.607654Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.08500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d74f22f0df76787cf91154da2ad327694801372e25db7dc5ec99325382a330a3","sha256:6d3a864c612ff523b60054c6becf5c1eafb77eeaf55d15448e38390aa2d8b8b0"],"state_sha256":"6ce7eb685fbb9cf85e3c945cc3826935af36fe682c9a8d185a54573340ff82f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCtzH+jegcNGX2bp4Za0bscxbT0hvhgrDn39wb97gAv3EE/N3Q+9l1yw6CmsUFyQjqbA2ufFQB8EPxk5bdDNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T23:12:50.783439Z","bundle_sha256":"b9609c8aed6d6edfd296149c0d2e67e76516f97da41a80baa34a01a155841ce7"}}