{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:473O4475DCNKZWXVWQ2P66LCXI","short_pith_number":"pith:473O4475","canonical_record":{"source":{"id":"2207.05899","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-13T00:12:02Z","cross_cats_sorted":[],"title_canon_sha256":"448e7a6c6ad54f98a063b82d2a457f4e6620367fde2350c34360f0b37cad540a","abstract_canon_sha256":"be87cd8d0f20fc3530123daf36c242509361354da9f6bb950428c7f28d31a139"},"schema_version":"1.0"},"canonical_sha256":"e7f6ee73fd189aacdaf5b434ff7962ba37217e1121f708e42716b7e9de213b46","source":{"kind":"arxiv","id":"2207.05899","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.05899","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2207.05899v2","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05899","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"473O4475DCNK","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"473O4475DCNKZWXV","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"473O4475","created_at":"2026-07-05T05:04:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:473O4475DCNKZWXVWQ2P66LCXI","target":"record","payload":{"canonical_record":{"source":{"id":"2207.05899","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-13T00:12:02Z","cross_cats_sorted":[],"title_canon_sha256":"448e7a6c6ad54f98a063b82d2a457f4e6620367fde2350c34360f0b37cad540a","abstract_canon_sha256":"be87cd8d0f20fc3530123daf36c242509361354da9f6bb950428c7f28d31a139"},"schema_version":"1.0"},"canonical_sha256":"e7f6ee73fd189aacdaf5b434ff7962ba37217e1121f708e42716b7e9de213b46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:30.193825Z","signature_b64":"XlLfhXFw68KaL1/Peig0ocwiRarX6bCro1Qrf+5an8dFdZdaCp6GngCMNC4OufdInmsWo12rnfKgGItJaUTfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7f6ee73fd189aacdaf5b434ff7962ba37217e1121f708e42716b7e9de213b46","last_reissued_at":"2026-07-05T05:04:30.193424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:30.193424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.05899","source_version":2,"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-05T05:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C54XBP3lGm1PyyQVrwP3gMOCWmgwUmoNL8pG7BLsBuCFkmyRunSRogGB6F5MyiZRG0uZQ0wxKI1LKxWEqe8qAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:31:17.322925Z"},"content_sha256":"994984f373d0beafb559461feed5460089e5b6f8d323ad45bdcc902e5f9b3f08","schema_version":"1.0","event_id":"sha256:994984f373d0beafb559461feed5460089e5b6f8d323ad45bdcc902e5f9b3f08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:473O4475DCNKZWXVWQ2P66LCXI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Topological Ordering for Computation Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christopher Lott, Corrado Rainone, Harris Teague, Herke van Hoof, Mukul Gagrani, Piero Zappi, Roberto Bondesan, Weiliang Will Zeng, Wonseok Jeon, Yang Yang","submitted_at":"2022-07-13T00:12:02Z","abstract_excerpt":"Recent works on machine learning for combinatorial optimization have shown that learning based approaches can outperform heuristic methods in terms of speed and performance. In this paper, we consider the problem of finding an optimal topological order on a directed acyclic graph with focus on the memory minimization problem which arises in compilers. We propose an end-to-end machine learning based approach for topological ordering using an encoder-decoder framework. Our encoder is a novel attention based graph neural network architecture called \\emph{Topoformer} which uses different topologic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05899","kind":"arxiv","version":2},"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/2207.05899/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-05T05:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1DTvjjZmn/CV/v9AeljUwb4GfUTzRQreVI9nQn5U8r+FAdkUB9Vg17pljlowO7xBrkxqVEZY+4F5M5agNW8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:31:17.323517Z"},"content_sha256":"bee58e506d1b6bbfe4f05479f8c97bac6f34df9190c345dc1ae13c81f3c2cb30","schema_version":"1.0","event_id":"sha256:bee58e506d1b6bbfe4f05479f8c97bac6f34df9190c345dc1ae13c81f3c2cb30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/473O4475DCNKZWXVWQ2P66LCXI/bundle.json","state_url":"https://pith.science/pith/473O4475DCNKZWXVWQ2P66LCXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/473O4475DCNKZWXVWQ2P66LCXI/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-05T16:31:17Z","links":{"resolver":"https://pith.science/pith/473O4475DCNKZWXVWQ2P66LCXI","bundle":"https://pith.science/pith/473O4475DCNKZWXVWQ2P66LCXI/bundle.json","state":"https://pith.science/pith/473O4475DCNKZWXVWQ2P66LCXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/473O4475DCNKZWXVWQ2P66LCXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:473O4475DCNKZWXVWQ2P66LCXI","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":"be87cd8d0f20fc3530123daf36c242509361354da9f6bb950428c7f28d31a139","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-13T00:12:02Z","title_canon_sha256":"448e7a6c6ad54f98a063b82d2a457f4e6620367fde2350c34360f0b37cad540a"},"schema_version":"1.0","source":{"id":"2207.05899","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.05899","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2207.05899v2","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.05899","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"473O4475DCNK","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"473O4475DCNKZWXV","created_at":"2026-07-05T05:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"473O4475","created_at":"2026-07-05T05:04:30Z"}],"graph_snapshots":[{"event_id":"sha256:bee58e506d1b6bbfe4f05479f8c97bac6f34df9190c345dc1ae13c81f3c2cb30","target":"graph","created_at":"2026-07-05T05:04:30Z","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/2207.05899/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent works on machine learning for combinatorial optimization have shown that learning based approaches can outperform heuristic methods in terms of speed and performance. In this paper, we consider the problem of finding an optimal topological order on a directed acyclic graph with focus on the memory minimization problem which arises in compilers. We propose an end-to-end machine learning based approach for topological ordering using an encoder-decoder framework. Our encoder is a novel attention based graph neural network architecture called \\emph{Topoformer} which uses different topologic","authors_text":"Christopher Lott, Corrado Rainone, Harris Teague, Herke van Hoof, Mukul Gagrani, Piero Zappi, Roberto Bondesan, Weiliang Will Zeng, Wonseok Jeon, Yang Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-13T00:12:02Z","title":"Neural Topological Ordering for Computation Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.05899","kind":"arxiv","version":2},"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:994984f373d0beafb559461feed5460089e5b6f8d323ad45bdcc902e5f9b3f08","target":"record","created_at":"2026-07-05T05:04:30Z","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":"be87cd8d0f20fc3530123daf36c242509361354da9f6bb950428c7f28d31a139","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-13T00:12:02Z","title_canon_sha256":"448e7a6c6ad54f98a063b82d2a457f4e6620367fde2350c34360f0b37cad540a"},"schema_version":"1.0","source":{"id":"2207.05899","kind":"arxiv","version":2}},"canonical_sha256":"e7f6ee73fd189aacdaf5b434ff7962ba37217e1121f708e42716b7e9de213b46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7f6ee73fd189aacdaf5b434ff7962ba37217e1121f708e42716b7e9de213b46","first_computed_at":"2026-07-05T05:04:30.193424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:30.193424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XlLfhXFw68KaL1/Peig0ocwiRarX6bCro1Qrf+5an8dFdZdaCp6GngCMNC4OufdInmsWo12rnfKgGItJaUTfBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:30.193825Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.05899","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:994984f373d0beafb559461feed5460089e5b6f8d323ad45bdcc902e5f9b3f08","sha256:bee58e506d1b6bbfe4f05479f8c97bac6f34df9190c345dc1ae13c81f3c2cb30"],"state_sha256":"68f2263af5ea21193c279f2acd968e29bc77d907d6d45c28aae929d6a88827f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4r7PX9R+bsd+w9rrMPxkd11Q2+Df1bE1TnVOPXdMTVDy3DEP4Zfqjllga9mC2gWR6evrhJolWYksfPo1MjECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T16:31:17.327653Z","bundle_sha256":"274f956f5a0382ab260d2497075d8d623ca2ee56cbb497946399bb671e3db2ec"}}