{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:65KFPW5TYL2P25AKXMT2BAUH37","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":"6a346ceef3b6c86292d9329d3466140cfbff5c6955945e811491a433b37555c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-29T13:56:45Z","title_canon_sha256":"a990ffb45f19c4b67e2bc598b58b9918cc043c54aa76481256d712a9aaa6137a"},"schema_version":"1.0","source":{"id":"1901.10289","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10289","created_at":"2026-07-05T00:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10289v2","created_at":"2026-07-05T00:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10289","created_at":"2026-07-05T00:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"65KFPW5TYL2P","created_at":"2026-07-05T00:20:11Z"},{"alias_kind":"pith_short_16","alias_value":"65KFPW5TYL2P25AK","created_at":"2026-07-05T00:20:11Z"},{"alias_kind":"pith_short_8","alias_value":"65KFPW5T","created_at":"2026-07-05T00:20:11Z"}],"graph_snapshots":[{"event_id":"sha256:1f021717a87a5f950e4bb602f16346c7e2a4442c5faac0ee62ef6f009c025549","target":"graph","created_at":"2026-07-05T00:20:11Z","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/1901.10289/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning to predict solutions to real-valued combinatorial graph problems promises efficient approximations. As demonstrated based on the NP-hard edge clique cover number, recurrent neural networks (RNNs) are particularly suited for this task and can even outperform state-of-the-art heuristics. However, the theoretical framework for estimating real-valued RNNs is understood only poorly. As our primary contribution, this is the first work that upper bounds the sample complexity for learning real-valued RNNs. While such derivations have been made earlier for feed-forward and convolutional neural","authors_text":"Bernhard Kratzwald, Nil-Jana Akpinar, Stefan Feuerriegel","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-29T13:56:45Z","title":"Sample Complexity Bounds for Recurrent Neural Networks with Application to Combinatorial Graph Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10289","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:ce597be2fa6f60681be8c7539960f107a39f6b4f76bb352689dde492bfc489a3","target":"record","created_at":"2026-07-05T00:20:11Z","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":"6a346ceef3b6c86292d9329d3466140cfbff5c6955945e811491a433b37555c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-29T13:56:45Z","title_canon_sha256":"a990ffb45f19c4b67e2bc598b58b9918cc043c54aa76481256d712a9aaa6137a"},"schema_version":"1.0","source":{"id":"1901.10289","kind":"arxiv","version":2}},"canonical_sha256":"f75457dbb3c2f4fd740abb27a08287dfd8edbf6182d5b2144ab3218e159fb425","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f75457dbb3c2f4fd740abb27a08287dfd8edbf6182d5b2144ab3218e159fb425","first_computed_at":"2026-07-05T00:20:11.815891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:20:11.815891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ZswD38kV3QXEmFDU1gwbW6QmAWHIbq5YEieXaGU4yS4pqoHWS4Iw8dMoJIZpluRRJ+OSVBcgX7k7/W7MpFQDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:20:11.816258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10289","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce597be2fa6f60681be8c7539960f107a39f6b4f76bb352689dde492bfc489a3","sha256:1f021717a87a5f950e4bb602f16346c7e2a4442c5faac0ee62ef6f009c025549"],"state_sha256":"5ebc1e62915ce9d046cbf4274a820b6cc17e3eb00e39d669a733cb4d3d4a09fd"}