{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6PD4RVBGMBBODCNOEUIFC32GVB","short_pith_number":"pith:6PD4RVBG","schema_version":"1.0","canonical_sha256":"f3c7c8d4266042e189ae2510516f46a85f0f3ae739c28113b51dd0b6fa837dc0","source":{"kind":"arxiv","id":"2411.13028","version":1},"attestation_state":"computed","paper":{"title":"A Theory for Compressibility of Graph Transformers for Transductive Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ameya Velingker, Balaji Venkatachalam, Danica Sutherland, David Woodruff, Hamed Shirzad, Honghao Lin","submitted_at":"2024-11-20T04:20:17Z","abstract_excerpt":"Transductive tasks on graphs differ fundamentally from typical supervised machine learning tasks, as the independent and identically distributed (i.i.d.) assumption does not hold among samples. Instead, all train/test/validation samples are present during training, making them more akin to a semi-supervised task. These differences make the analysis of the models substantially different from other models. Recently, Graph Transformers have significantly improved results on these datasets by overcoming long-range dependency problems. However, the quadratic complexity of full Transformers has driv"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.13028","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-20T04:20:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d9f2031f1885550121a4d8b8caf5e4fdc282d037ca033d50df4d262e42dfeff8","abstract_canon_sha256":"d6d224a6cef3ecdfb4ffde4b8329b7f2a76a0face8b7bffc64741ce001fdf12d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:03.949969Z","signature_b64":"2ppSaCnL4wqtk4XQFKJFZv7aKJ148PhwjRV50OeIRAZnqaHHirESuGkGCrlabQ2xSy+19vX9ELmHYBiKOdbuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3c7c8d4266042e189ae2510516f46a85f0f3ae739c28113b51dd0b6fa837dc0","last_reissued_at":"2026-07-05T09:38:03.949519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:03.949519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theory for Compressibility of Graph Transformers for Transductive Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ameya Velingker, Balaji Venkatachalam, Danica Sutherland, David Woodruff, Hamed Shirzad, Honghao Lin","submitted_at":"2024-11-20T04:20:17Z","abstract_excerpt":"Transductive tasks on graphs differ fundamentally from typical supervised machine learning tasks, as the independent and identically distributed (i.i.d.) assumption does not hold among samples. Instead, all train/test/validation samples are present during training, making them more akin to a semi-supervised task. These differences make the analysis of the models substantially different from other models. Recently, Graph Transformers have significantly improved results on these datasets by overcoming long-range dependency problems. However, the quadratic complexity of full Transformers has driv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13028","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/2411.13028/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.13028","created_at":"2026-07-05T09:38:03.949573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13028v1","created_at":"2026-07-05T09:38:03.949573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13028","created_at":"2026-07-05T09:38:03.949573+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PD4RVBGMBBO","created_at":"2026-07-05T09:38:03.949573+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PD4RVBGMBBODCNO","created_at":"2026-07-05T09:38:03.949573+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PD4RVBG","created_at":"2026-07-05T09:38:03.949573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23753","citing_title":"SeedER: Seed-and-Expand Retrieval from Knowledge Graphs","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB","json":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB.json","graph_json":"https://pith.science/api/pith-number/6PD4RVBGMBBODCNOEUIFC32GVB/graph.json","events_json":"https://pith.science/api/pith-number/6PD4RVBGMBBODCNOEUIFC32GVB/events.json","paper":"https://pith.science/paper/6PD4RVBG"},"agent_actions":{"view_html":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB","download_json":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB.json","view_paper":"https://pith.science/paper/6PD4RVBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13028&json=true","fetch_graph":"https://pith.science/api/pith-number/6PD4RVBGMBBODCNOEUIFC32GVB/graph.json","fetch_events":"https://pith.science/api/pith-number/6PD4RVBGMBBODCNOEUIFC32GVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB/action/storage_attestation","attest_author":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB/action/author_attestation","sign_citation":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB/action/citation_signature","submit_replication":"https://pith.science/pith/6PD4RVBGMBBODCNOEUIFC32GVB/action/replication_record"}},"created_at":"2026-07-05T09:38:03.949573+00:00","updated_at":"2026-07-05T09:38:03.949573+00:00"}