{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZCTMBOIOQY4W5ZCFOHI6B3MVT5","short_pith_number":"pith:ZCTMBOIO","canonical_record":{"source":{"id":"2605.20637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-20T02:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"96bdf9289f35cc55e94488fdbfcb826cae09823f4e1c3c656057ca4a0b4959c8","abstract_canon_sha256":"18e8d86a46bbd2d17b25ce2cfe9227078ca23469b8287559bbb26025d4b995e9"},"schema_version":"1.0"},"canonical_sha256":"c8a6c0b90e86396ee44571d1e0ed959f56f2dda3edcefd5567acbaeb9da03db8","source":{"kind":"arxiv","id":"2605.20637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20637","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20637v1","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20637","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZCTMBOIOQY4W","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"ZCTMBOIOQY4W5ZCF","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"ZCTMBOIO","created_at":"2026-05-21T01:04:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZCTMBOIOQY4W5ZCFOHI6B3MVT5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-20T02:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"96bdf9289f35cc55e94488fdbfcb826cae09823f4e1c3c656057ca4a0b4959c8","abstract_canon_sha256":"18e8d86a46bbd2d17b25ce2cfe9227078ca23469b8287559bbb26025d4b995e9"},"schema_version":"1.0"},"canonical_sha256":"c8a6c0b90e86396ee44571d1e0ed959f56f2dda3edcefd5567acbaeb9da03db8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:46.162832Z","signature_b64":"0CkOjgeC/jNo/wXfNFOPpYJigdfCHmAaUr/DmaX4rFbAGyeOYx7ZhAiUJSFcYBP48fSclF6SMDyabNUD490cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8a6c0b90e86396ee44571d1e0ed959f56f2dda3edcefd5567acbaeb9da03db8","last_reissued_at":"2026-05-21T01:04:46.162245Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:46.162245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20637","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-05-21T01:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hsjzmeu5Y+e3GYZ2y9S5wP6v1B/9d0gQy18PTFX5Q+2kG9jy3fd81RXkqQZP/iM9hfry8YrXLmTrOM+WGcmwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:26:03.931374Z"},"content_sha256":"5125c24759e5752c9fd6ebf1aea72fab33d6092bb3900291815bdc02fd85c9c4","schema_version":"1.0","event_id":"sha256:5125c24759e5752c9fd6ebf1aea72fab33d6092bb3900291815bdc02fd85c9c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZCTMBOIOQY4W5ZCFOHI6B3MVT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PUBO Formulation for MST and Application to Optimum-Path Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danilo S. Jodas, Douglas Rodrigues, Felipe F. Fanchini, Guilherme E. L. Pexe, Jo\\~ao P. Papa, Kelton A. P. Costa, Leandro A. Passos, Lucas A. M. Rattighieri","submitted_at":"2026-05-20T02:46:56Z","abstract_excerpt":"The Optimum-Path Forest is a graph-based framework for designing classifiers that exploit inter-sample connectivity. A particular variant constructs decision boundaries based on prototypes computed by a Minimum Spanning Tree (MST) over the training data, which might become prohibitive for large-scale datasets. In this context, Quantum Machine Learning has emerged as a promising approach to overcome the high computational burden of combinatorial problems. We propose a quantum-inspired approach for prototype selection in OPF classifiers by reformulating the MST problem as a Polynomial Unconstrai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20637","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/2605.20637/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-05-21T01:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvx/eLhpGXDu+ysy1FeyZSlWraQ44rzhoNjoXSmub6PkpGd+zXKnXnDFQFDrt7OV9amwVyxi4I3LWgmmwkwdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:26:03.932093Z"},"content_sha256":"18df1067bcd67b9c7ca05b542c55a744dd8f663f1f163b9fe16cf6dcaaef1377","schema_version":"1.0","event_id":"sha256:18df1067bcd67b9c7ca05b542c55a744dd8f663f1f163b9fe16cf6dcaaef1377"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCTMBOIOQY4W5ZCFOHI6B3MVT5/bundle.json","state_url":"https://pith.science/pith/ZCTMBOIOQY4W5ZCFOHI6B3MVT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCTMBOIOQY4W5ZCFOHI6B3MVT5/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-05-24T15:26:03Z","links":{"resolver":"https://pith.science/pith/ZCTMBOIOQY4W5ZCFOHI6B3MVT5","bundle":"https://pith.science/pith/ZCTMBOIOQY4W5ZCFOHI6B3MVT5/bundle.json","state":"https://pith.science/pith/ZCTMBOIOQY4W5ZCFOHI6B3MVT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCTMBOIOQY4W5ZCFOHI6B3MVT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZCTMBOIOQY4W5ZCFOHI6B3MVT5","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":"18e8d86a46bbd2d17b25ce2cfe9227078ca23469b8287559bbb26025d4b995e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-20T02:46:56Z","title_canon_sha256":"96bdf9289f35cc55e94488fdbfcb826cae09823f4e1c3c656057ca4a0b4959c8"},"schema_version":"1.0","source":{"id":"2605.20637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20637","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20637v1","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20637","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZCTMBOIOQY4W","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"ZCTMBOIOQY4W5ZCF","created_at":"2026-05-21T01:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"ZCTMBOIO","created_at":"2026-05-21T01:04:46Z"}],"graph_snapshots":[{"event_id":"sha256:18df1067bcd67b9c7ca05b542c55a744dd8f663f1f163b9fe16cf6dcaaef1377","target":"graph","created_at":"2026-05-21T01:04:46Z","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/2605.20637/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Optimum-Path Forest is a graph-based framework for designing classifiers that exploit inter-sample connectivity. A particular variant constructs decision boundaries based on prototypes computed by a Minimum Spanning Tree (MST) over the training data, which might become prohibitive for large-scale datasets. In this context, Quantum Machine Learning has emerged as a promising approach to overcome the high computational burden of combinatorial problems. We propose a quantum-inspired approach for prototype selection in OPF classifiers by reformulating the MST problem as a Polynomial Unconstrai","authors_text":"Danilo S. Jodas, Douglas Rodrigues, Felipe F. Fanchini, Guilherme E. L. Pexe, Jo\\~ao P. Papa, Kelton A. P. Costa, Leandro A. Passos, Lucas A. M. Rattighieri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-20T02:46:56Z","title":"PUBO Formulation for MST and Application to Optimum-Path Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20637","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:5125c24759e5752c9fd6ebf1aea72fab33d6092bb3900291815bdc02fd85c9c4","target":"record","created_at":"2026-05-21T01:04:46Z","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":"18e8d86a46bbd2d17b25ce2cfe9227078ca23469b8287559bbb26025d4b995e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-20T02:46:56Z","title_canon_sha256":"96bdf9289f35cc55e94488fdbfcb826cae09823f4e1c3c656057ca4a0b4959c8"},"schema_version":"1.0","source":{"id":"2605.20637","kind":"arxiv","version":1}},"canonical_sha256":"c8a6c0b90e86396ee44571d1e0ed959f56f2dda3edcefd5567acbaeb9da03db8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8a6c0b90e86396ee44571d1e0ed959f56f2dda3edcefd5567acbaeb9da03db8","first_computed_at":"2026-05-21T01:04:46.162245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:46.162245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0CkOjgeC/jNo/wXfNFOPpYJigdfCHmAaUr/DmaX4rFbAGyeOYx7ZhAiUJSFcYBP48fSclF6SMDyabNUD490cCg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:46.162832Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5125c24759e5752c9fd6ebf1aea72fab33d6092bb3900291815bdc02fd85c9c4","sha256:18df1067bcd67b9c7ca05b542c55a744dd8f663f1f163b9fe16cf6dcaaef1377"],"state_sha256":"f3eb58ed89b7f7e9e6aa76321d80f422687096e13c0623598ae79106120c2908"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJy/m7kPFe01JQAyWdJgKRhLp0OiYIEC0u2mafOOP6dROrYsa6mZLIWxYVe1W2o8ulqCtIwxtGtM26DiQavaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T15:26:03.935644Z","bundle_sha256":"c95dc3f471e23ebad5f1833f6ed98525b5a992985cd66f35225b41791979a3ef"}}