{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SJSDNUA2XWI73PQHPHKQ2CD6JX","short_pith_number":"pith:SJSDNUA2","canonical_record":{"source":{"id":"2403.18429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-27T10:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"a1ea5d2e090f407cc005d7049e270a3cbc66060c98e28d97922b73f8c680fc9a","abstract_canon_sha256":"64496a0794d48d4f12ddcb65a54294741ffba1058a1ef33bcde36aa8f539a66f"},"schema_version":"1.0"},"canonical_sha256":"926436d01abd91fdbe0779d50d087e4dc9e34fa1996bfc5c0437100369ee2dd8","source":{"kind":"arxiv","id":"2403.18429","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.18429","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"arxiv_version","alias_value":"2403.18429v2","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18429","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"pith_short_12","alias_value":"SJSDNUA2XWI7","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"pith_short_16","alias_value":"SJSDNUA2XWI73PQH","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"pith_short_8","alias_value":"SJSDNUA2","created_at":"2026-07-05T08:02:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SJSDNUA2XWI73PQHPHKQ2CD6JX","target":"record","payload":{"canonical_record":{"source":{"id":"2403.18429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-27T10:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"a1ea5d2e090f407cc005d7049e270a3cbc66060c98e28d97922b73f8c680fc9a","abstract_canon_sha256":"64496a0794d48d4f12ddcb65a54294741ffba1058a1ef33bcde36aa8f539a66f"},"schema_version":"1.0"},"canonical_sha256":"926436d01abd91fdbe0779d50d087e4dc9e34fa1996bfc5c0437100369ee2dd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:26.053899Z","signature_b64":"sE1nrjz83SJo0rHPKzJg3gWHv7+55Scu+rPiWJHSDzovv0671TWfvBWx3XZPooYll5iAgzNSK4+qLeZc74w5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926436d01abd91fdbe0779d50d087e4dc9e34fa1996bfc5c0437100369ee2dd8","last_reissued_at":"2026-07-05T08:02:26.053422Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:26.053422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.18429","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-05T08:02:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16vRHD6rHuUCb3ajSCTZhQef6lElopN/lgDi/XFvHc0Rg1zPeoY7KKJr9GxKKzj4OFefg+f/RHr7h8kGw8+1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:19:06.784814Z"},"content_sha256":"b38369994a807fc5aacbb452ae5141c9f196755abdd5b64392f0b9e9a2d9c0bd","schema_version":"1.0","event_id":"sha256:b38369994a807fc5aacbb452ae5141c9f196755abdd5b64392f0b9e9a2d9c0bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SJSDNUA2XWI73PQHPHKQ2CD6JX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Kanso, Dragan Stevanovic, Mohammad Ghebleh, Salem Al-Yakoob","submitted_at":"2024-03-27T10:35:41Z","abstract_excerpt":"We reimplement here the recent approach of Adam Zsolt Wagner [arXiv:2104.14516], which applies reinforcement learning to construct (counter)examples in graph theory, in order to make it more readable, more stable and much faster. The presented concepts are illustrated by constructing counterexamples for a number of published conjectured bounds for the Laplacian spectral radius of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18429","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/2403.18429/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-05T08:02:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHGhtG5CB7ltjcTeWgSLnGmbSN+4w9GDCJXU1o82tz/IhAOZ59qTxaYreSpuB7hrdy/+tBLmnq0HPuHXkB2vBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:19:06.785676Z"},"content_sha256":"1583ffeae54ddd11419e53ea63ae9da73cad244ce7db65d549dfc2aa7a1d6f7d","schema_version":"1.0","event_id":"sha256:1583ffeae54ddd11419e53ea63ae9da73cad244ce7db65d549dfc2aa7a1d6f7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJSDNUA2XWI73PQHPHKQ2CD6JX/bundle.json","state_url":"https://pith.science/pith/SJSDNUA2XWI73PQHPHKQ2CD6JX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJSDNUA2XWI73PQHPHKQ2CD6JX/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-08T19:19:06Z","links":{"resolver":"https://pith.science/pith/SJSDNUA2XWI73PQHPHKQ2CD6JX","bundle":"https://pith.science/pith/SJSDNUA2XWI73PQHPHKQ2CD6JX/bundle.json","state":"https://pith.science/pith/SJSDNUA2XWI73PQHPHKQ2CD6JX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJSDNUA2XWI73PQHPHKQ2CD6JX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SJSDNUA2XWI73PQHPHKQ2CD6JX","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":"64496a0794d48d4f12ddcb65a54294741ffba1058a1ef33bcde36aa8f539a66f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-27T10:35:41Z","title_canon_sha256":"a1ea5d2e090f407cc005d7049e270a3cbc66060c98e28d97922b73f8c680fc9a"},"schema_version":"1.0","source":{"id":"2403.18429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.18429","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"arxiv_version","alias_value":"2403.18429v2","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18429","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"pith_short_12","alias_value":"SJSDNUA2XWI7","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"pith_short_16","alias_value":"SJSDNUA2XWI73PQH","created_at":"2026-07-05T08:02:26Z"},{"alias_kind":"pith_short_8","alias_value":"SJSDNUA2","created_at":"2026-07-05T08:02:26Z"}],"graph_snapshots":[{"event_id":"sha256:1583ffeae54ddd11419e53ea63ae9da73cad244ce7db65d549dfc2aa7a1d6f7d","target":"graph","created_at":"2026-07-05T08:02:26Z","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/2403.18429/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We reimplement here the recent approach of Adam Zsolt Wagner [arXiv:2104.14516], which applies reinforcement learning to construct (counter)examples in graph theory, in order to make it more readable, more stable and much faster. The presented concepts are illustrated by constructing counterexamples for a number of published conjectured bounds for the Laplacian spectral radius of graphs.","authors_text":"Ali Kanso, Dragan Stevanovic, Mohammad Ghebleh, Salem Al-Yakoob","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-27T10:35:41Z","title":"Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18429","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:b38369994a807fc5aacbb452ae5141c9f196755abdd5b64392f0b9e9a2d9c0bd","target":"record","created_at":"2026-07-05T08:02:26Z","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":"64496a0794d48d4f12ddcb65a54294741ffba1058a1ef33bcde36aa8f539a66f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-27T10:35:41Z","title_canon_sha256":"a1ea5d2e090f407cc005d7049e270a3cbc66060c98e28d97922b73f8c680fc9a"},"schema_version":"1.0","source":{"id":"2403.18429","kind":"arxiv","version":2}},"canonical_sha256":"926436d01abd91fdbe0779d50d087e4dc9e34fa1996bfc5c0437100369ee2dd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"926436d01abd91fdbe0779d50d087e4dc9e34fa1996bfc5c0437100369ee2dd8","first_computed_at":"2026-07-05T08:02:26.053422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:02:26.053422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sE1nrjz83SJo0rHPKzJg3gWHv7+55Scu+rPiWJHSDzovv0671TWfvBWx3XZPooYll5iAgzNSK4+qLeZc74w5Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:02:26.053899Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.18429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b38369994a807fc5aacbb452ae5141c9f196755abdd5b64392f0b9e9a2d9c0bd","sha256:1583ffeae54ddd11419e53ea63ae9da73cad244ce7db65d549dfc2aa7a1d6f7d"],"state_sha256":"79b7edbc6c27b65936b388cd7c5a4fb0182e81882b677288f0acec90e1050b82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0TgGY1NLl/F8Eguu8Hg9p8vw4kPhhz4amETiLYbD61u9Kw+vvba0qQk4x0GDmmVH1Eb6ZdbV1uJIFXGmpRaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:19:06.791301Z","bundle_sha256":"f1e8d306bc8748679254ae649558119df841f0c2ce76d87fc48f5da270fb9e6a"}}