{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DC76OQ277SJOKNYYPC6TU377QT","short_pith_number":"pith:DC76OQ27","canonical_record":{"source":{"id":"2505.22949","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T00:05:07Z","cross_cats_sorted":[],"title_canon_sha256":"b5bf1dd1428e624199df7322b6c47459c664488c5443ef5e4d3e98fd11dc6a10","abstract_canon_sha256":"dafa7f440f55a3b8a1bfd4b73e6aa3ebe028b13dd93cb86ec0ac8f8962f96125"},"schema_version":"1.0"},"canonical_sha256":"18bfe7435ffc92e5371878bd3a6fff84f1dffb0511df35fb66a412ef689a89cf","source":{"kind":"arxiv","id":"2505.22949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.22949","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"2505.22949v1","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22949","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"DC76OQ277SJO","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"pith_short_16","alias_value":"DC76OQ277SJOKNYY","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"pith_short_8","alias_value":"DC76OQ27","created_at":"2026-07-05T11:11:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DC76OQ277SJOKNYYPC6TU377QT","target":"record","payload":{"canonical_record":{"source":{"id":"2505.22949","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T00:05:07Z","cross_cats_sorted":[],"title_canon_sha256":"b5bf1dd1428e624199df7322b6c47459c664488c5443ef5e4d3e98fd11dc6a10","abstract_canon_sha256":"dafa7f440f55a3b8a1bfd4b73e6aa3ebe028b13dd93cb86ec0ac8f8962f96125"},"schema_version":"1.0"},"canonical_sha256":"18bfe7435ffc92e5371878bd3a6fff84f1dffb0511df35fb66a412ef689a89cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:52.191632Z","signature_b64":"LolT17fg1a2FlMiWaB+xJBcjl1OXuPhBce/MASC0zu4rs/Dy4RM49t3x57rMCM1XnISiV/2SFGeDdgYTuJfjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18bfe7435ffc92e5371878bd3a6fff84f1dffb0511df35fb66a412ef689a89cf","last_reissued_at":"2026-07-05T11:11:52.191129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:52.191129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.22949","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-05T11:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Va+qO4or+UvkjQMeROMAMIN0o8qtl6OdJDWNbdzOW//T8HKgFUPMKSQw3ndq8jNRyuiTCll0XsifJCi+V1mjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:40:23.163129Z"},"content_sha256":"5eec81e21f8b92d2ce277d68ca2542f74f53ad7e89d053ef93ae3ced7f460341","schema_version":"1.0","event_id":"sha256:5eec81e21f8b92d2ce277d68ca2542f74f53ad7e89d053ef93ae3ced7f460341"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DC76OQ277SJOKNYYPC6TU377QT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Directed Graph Grammars for Sequence-based Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gang Liu, Jie Chen, Michael Sun, Orion Foo, Wojciech Matusik","submitted_at":"2025-05-29T00:05:07Z","abstract_excerpt":"Directed acyclic graphs (DAGs) are a class of graphs commonly used in practice, with examples that include electronic circuits, Bayesian networks, and neural architectures. While many effective encoders exist for DAGs, it remains challenging to decode them in a principled manner, because the nodes of a DAG can have many different topological orders. In this work, we propose a grammar-based approach to constructing a principled, compact and equivalent sequential representation of a DAG. Specifically, we view a graph as derivations over an unambiguous grammar, where the DAG corresponds to a uniq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22949","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/2505.22949/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-05T11:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3cqlckXf5bpj00g/xBoo0j1bu0JaQBJYDj+krTR5zk8z9/WptllKY6WPcC7Crphx1U1tFkISYRJ2kbT87FMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:40:23.164070Z"},"content_sha256":"5915b38a47ba641bd6f18ceb48610afb9d78960398ba17e204d3675fb42bc03a","schema_version":"1.0","event_id":"sha256:5915b38a47ba641bd6f18ceb48610afb9d78960398ba17e204d3675fb42bc03a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DC76OQ277SJOKNYYPC6TU377QT/bundle.json","state_url":"https://pith.science/pith/DC76OQ277SJOKNYYPC6TU377QT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DC76OQ277SJOKNYYPC6TU377QT/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-17T14:40:23Z","links":{"resolver":"https://pith.science/pith/DC76OQ277SJOKNYYPC6TU377QT","bundle":"https://pith.science/pith/DC76OQ277SJOKNYYPC6TU377QT/bundle.json","state":"https://pith.science/pith/DC76OQ277SJOKNYYPC6TU377QT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DC76OQ277SJOKNYYPC6TU377QT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DC76OQ277SJOKNYYPC6TU377QT","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":"dafa7f440f55a3b8a1bfd4b73e6aa3ebe028b13dd93cb86ec0ac8f8962f96125","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T00:05:07Z","title_canon_sha256":"b5bf1dd1428e624199df7322b6c47459c664488c5443ef5e4d3e98fd11dc6a10"},"schema_version":"1.0","source":{"id":"2505.22949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.22949","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"2505.22949v1","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22949","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"DC76OQ277SJO","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"pith_short_16","alias_value":"DC76OQ277SJOKNYY","created_at":"2026-07-05T11:11:52Z"},{"alias_kind":"pith_short_8","alias_value":"DC76OQ27","created_at":"2026-07-05T11:11:52Z"}],"graph_snapshots":[{"event_id":"sha256:5915b38a47ba641bd6f18ceb48610afb9d78960398ba17e204d3675fb42bc03a","target":"graph","created_at":"2026-07-05T11:11:52Z","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/2505.22949/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Directed acyclic graphs (DAGs) are a class of graphs commonly used in practice, with examples that include electronic circuits, Bayesian networks, and neural architectures. While many effective encoders exist for DAGs, it remains challenging to decode them in a principled manner, because the nodes of a DAG can have many different topological orders. In this work, we propose a grammar-based approach to constructing a principled, compact and equivalent sequential representation of a DAG. Specifically, we view a graph as derivations over an unambiguous grammar, where the DAG corresponds to a uniq","authors_text":"Gang Liu, Jie Chen, Michael Sun, Orion Foo, Wojciech Matusik","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T00:05:07Z","title":"Directed Graph Grammars for Sequence-based Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22949","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:5eec81e21f8b92d2ce277d68ca2542f74f53ad7e89d053ef93ae3ced7f460341","target":"record","created_at":"2026-07-05T11:11:52Z","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":"dafa7f440f55a3b8a1bfd4b73e6aa3ebe028b13dd93cb86ec0ac8f8962f96125","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T00:05:07Z","title_canon_sha256":"b5bf1dd1428e624199df7322b6c47459c664488c5443ef5e4d3e98fd11dc6a10"},"schema_version":"1.0","source":{"id":"2505.22949","kind":"arxiv","version":1}},"canonical_sha256":"18bfe7435ffc92e5371878bd3a6fff84f1dffb0511df35fb66a412ef689a89cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18bfe7435ffc92e5371878bd3a6fff84f1dffb0511df35fb66a412ef689a89cf","first_computed_at":"2026-07-05T11:11:52.191129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:52.191129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LolT17fg1a2FlMiWaB+xJBcjl1OXuPhBce/MASC0zu4rs/Dy4RM49t3x57rMCM1XnISiV/2SFGeDdgYTuJfjAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:52.191632Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.22949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5eec81e21f8b92d2ce277d68ca2542f74f53ad7e89d053ef93ae3ced7f460341","sha256:5915b38a47ba641bd6f18ceb48610afb9d78960398ba17e204d3675fb42bc03a"],"state_sha256":"3d1b1d82d1069a2a4543b01da78685d20951caa3c14db94da1374cc223ac64e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t5UEAT3sHEGbdJpDTyvFjB6q+maEVzu579zmyrPuY1zvzBzmkB9eVkpssFBkrnEOPqL01AitMIpcsaIDjhmvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T14:40:23.170063Z","bundle_sha256":"c3793a46bc504369fec2f3e9e91d8715e7af112dd23ba856f3aeb9d9ec380e88"}}