{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RFBYOUXVIYXTQUSPK6T2DJY6FT","short_pith_number":"pith:RFBYOUXV","schema_version":"1.0","canonical_sha256":"89438752f5462f38524f57a7a1a71e2cc01f68d7b578ad3e241d8da302f74de8","source":{"kind":"arxiv","id":"2607.07705","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Spanning Trees for Directed Acyclicity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Sergei Khargeliia","submitted_at":"2026-07-08T17:58:37Z","abstract_excerpt":"We study the weighted case of the \\textsc{Maximum Acyclic Subgraph (MAS)} problem, where each edge of a given directed graph has a positive weight assigned, and the task is to find a maximum-weight acyclic edge set. The famous and well-studied random ordering lower bound guarantees the existence of an acyclic set that gives at least the half of the total edge weight.\n  The maximum spanning tree (MaxST) guarantee, which is the weight of a maximum-weight acyclic subgraph of the underlying undirected graph of $G$, is another natural lower bound for the weight of an acyclic subgraph. A solution of"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.07705","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T17:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"dccc4cd8ee9181fbc4a7c78eadef7114f70471796eefac8dea238a6b1d96fb81","abstract_canon_sha256":"5525d7b18692824f254b70e72f6249d9a364e54840deaa567d820a0334c81e3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:39.740995Z","signature_b64":"Ew/ftSuO6mFfXXCW/vt5kcZuUOb8L+3OHxJgfzL8iNwrZyr9eBaVJwx3fb51lH9CHwLqei+wetvFYx5R692GDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89438752f5462f38524f57a7a1a71e2cc01f68d7b578ad3e241d8da302f74de8","last_reissued_at":"2026-07-09T01:20:39.740563Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:39.740563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Spanning Trees for Directed Acyclicity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Sergei Khargeliia","submitted_at":"2026-07-08T17:58:37Z","abstract_excerpt":"We study the weighted case of the \\textsc{Maximum Acyclic Subgraph (MAS)} problem, where each edge of a given directed graph has a positive weight assigned, and the task is to find a maximum-weight acyclic edge set. The famous and well-studied random ordering lower bound guarantees the existence of an acyclic set that gives at least the half of the total edge weight.\n  The maximum spanning tree (MaxST) guarantee, which is the weight of a maximum-weight acyclic subgraph of the underlying undirected graph of $G$, is another natural lower bound for the weight of an acyclic subgraph. A solution of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07705","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/2607.07705/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.07705","created_at":"2026-07-09T01:20:39.740623+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07705v1","created_at":"2026-07-09T01:20:39.740623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07705","created_at":"2026-07-09T01:20:39.740623+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFBYOUXVIYXT","created_at":"2026-07-09T01:20:39.740623+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFBYOUXVIYXTQUSP","created_at":"2026-07-09T01:20:39.740623+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFBYOUXV","created_at":"2026-07-09T01:20:39.740623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT","json":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT.json","graph_json":"https://pith.science/api/pith-number/RFBYOUXVIYXTQUSPK6T2DJY6FT/graph.json","events_json":"https://pith.science/api/pith-number/RFBYOUXVIYXTQUSPK6T2DJY6FT/events.json","paper":"https://pith.science/paper/RFBYOUXV"},"agent_actions":{"view_html":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT","download_json":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT.json","view_paper":"https://pith.science/paper/RFBYOUXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07705&json=true","fetch_graph":"https://pith.science/api/pith-number/RFBYOUXVIYXTQUSPK6T2DJY6FT/graph.json","fetch_events":"https://pith.science/api/pith-number/RFBYOUXVIYXTQUSPK6T2DJY6FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT/action/storage_attestation","attest_author":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT/action/author_attestation","sign_citation":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT/action/citation_signature","submit_replication":"https://pith.science/pith/RFBYOUXVIYXTQUSPK6T2DJY6FT/action/replication_record"}},"created_at":"2026-07-09T01:20:39.740623+00:00","updated_at":"2026-07-09T01:20:39.740623+00:00"}