{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DUXXQ7F7GOLWBUELU3NNVLBFMQ","short_pith_number":"pith:DUXXQ7F7","canonical_record":{"source":{"id":"2503.10447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-13T15:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"0dcb81122690b9e6b026a2fc2c1acd88ad1000c455346a0b0e825c8d2260a3fd","abstract_canon_sha256":"36e5b9bf0b625ef62c1311f2fdc579c30d21630dda84b4360aa3055fe0f39353"},"schema_version":"1.0"},"canonical_sha256":"1d2f787cbf339760d08ba6dadaac256426aefaa3ad69ece9fc90495aca6fe21b","source":{"kind":"arxiv","id":"2503.10447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10447","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10447v1","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10447","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"DUXXQ7F7GOLW","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_16","alias_value":"DUXXQ7F7GOLWBUEL","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_8","alias_value":"DUXXQ7F7","created_at":"2026-07-05T10:30:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DUXXQ7F7GOLWBUELU3NNVLBFMQ","target":"record","payload":{"canonical_record":{"source":{"id":"2503.10447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-13T15:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"0dcb81122690b9e6b026a2fc2c1acd88ad1000c455346a0b0e825c8d2260a3fd","abstract_canon_sha256":"36e5b9bf0b625ef62c1311f2fdc579c30d21630dda84b4360aa3055fe0f39353"},"schema_version":"1.0"},"canonical_sha256":"1d2f787cbf339760d08ba6dadaac256426aefaa3ad69ece9fc90495aca6fe21b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:45.504808Z","signature_b64":"jis5UISsJhHRuok+ElmfI/d6iJo471p5YoJeah0djI/MOqVR/qz05Bh6QGthJ6gw/APi/CNanaMtQUjarnMzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d2f787cbf339760d08ba6dadaac256426aefaa3ad69ece9fc90495aca6fe21b","last_reissued_at":"2026-07-05T10:30:45.504245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:45.504245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.10447","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-05T10:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egIIVS3s1MxiJ2s1bXDNAUGezWghYdFBgJdfsRNKrmPsziv7Pr6g+IgS5M+UKISHkQMU3sLRniIjaT2xW6nABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:48:31.535512Z"},"content_sha256":"596c51b1f26272ebee40f968aefb5f4f0d027758c93d2476da050e4cdd775354","schema_version":"1.0","event_id":"sha256:596c51b1f26272ebee40f968aefb5f4f0d027758c93d2476da050e4cdd775354"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DUXXQ7F7GOLWBUELU3NNVLBFMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tian Bai","submitted_at":"2025-03-13T15:11:45Z","abstract_excerpt":"In the Feedback Arc Set in Tournaments (Subset-FAST) problem, we are given a tournament $D$ and a positive integer $k$, and the objective is to determine whether there exists an arc set $S \\subseteq A(D)$ of size at most $k$ whose removal makes the graph acyclic. This problem is well-known to be equivalent to a natural tournament ranking problem, whose task is to rank players in a tournament such that the number of pairs in which the lower-ranked player defeats the higher-ranked player is no more than $k$. Using the PTAS for Subset-FAST [STOC 2007], Bessy et al. [JCSS 2011] present a $(2 + \\va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10447","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/2503.10447/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-05T10:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CyuQzziDc6rLPuryyso9kkc58K46r0S41YseoaJYzuOhPEZYwxegTc8JkoYIIBlDQzx7Bw+MvlRYA74n5ChRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:48:31.536034Z"},"content_sha256":"5c731e550c04dec75f8cc01d65122dc42c17015dea98ad9813c759360b068865","schema_version":"1.0","event_id":"sha256:5c731e550c04dec75f8cc01d65122dc42c17015dea98ad9813c759360b068865"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUXXQ7F7GOLWBUELU3NNVLBFMQ/bundle.json","state_url":"https://pith.science/pith/DUXXQ7F7GOLWBUELU3NNVLBFMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUXXQ7F7GOLWBUELU3NNVLBFMQ/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-17T05:48:31Z","links":{"resolver":"https://pith.science/pith/DUXXQ7F7GOLWBUELU3NNVLBFMQ","bundle":"https://pith.science/pith/DUXXQ7F7GOLWBUELU3NNVLBFMQ/bundle.json","state":"https://pith.science/pith/DUXXQ7F7GOLWBUELU3NNVLBFMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUXXQ7F7GOLWBUELU3NNVLBFMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DUXXQ7F7GOLWBUELU3NNVLBFMQ","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":"36e5b9bf0b625ef62c1311f2fdc579c30d21630dda84b4360aa3055fe0f39353","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-13T15:11:45Z","title_canon_sha256":"0dcb81122690b9e6b026a2fc2c1acd88ad1000c455346a0b0e825c8d2260a3fd"},"schema_version":"1.0","source":{"id":"2503.10447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10447","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10447v1","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10447","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"DUXXQ7F7GOLW","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_16","alias_value":"DUXXQ7F7GOLWBUEL","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_8","alias_value":"DUXXQ7F7","created_at":"2026-07-05T10:30:45Z"}],"graph_snapshots":[{"event_id":"sha256:5c731e550c04dec75f8cc01d65122dc42c17015dea98ad9813c759360b068865","target":"graph","created_at":"2026-07-05T10:30:45Z","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/2503.10447/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the Feedback Arc Set in Tournaments (Subset-FAST) problem, we are given a tournament $D$ and a positive integer $k$, and the objective is to determine whether there exists an arc set $S \\subseteq A(D)$ of size at most $k$ whose removal makes the graph acyclic. This problem is well-known to be equivalent to a natural tournament ranking problem, whose task is to rank players in a tournament such that the number of pairs in which the lower-ranked player defeats the higher-ranked player is no more than $k$. Using the PTAS for Subset-FAST [STOC 2007], Bessy et al. [JCSS 2011] present a $(2 + \\va","authors_text":"Tian Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-13T15:11:45Z","title":"An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10447","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:596c51b1f26272ebee40f968aefb5f4f0d027758c93d2476da050e4cdd775354","target":"record","created_at":"2026-07-05T10:30:45Z","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":"36e5b9bf0b625ef62c1311f2fdc579c30d21630dda84b4360aa3055fe0f39353","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-13T15:11:45Z","title_canon_sha256":"0dcb81122690b9e6b026a2fc2c1acd88ad1000c455346a0b0e825c8d2260a3fd"},"schema_version":"1.0","source":{"id":"2503.10447","kind":"arxiv","version":1}},"canonical_sha256":"1d2f787cbf339760d08ba6dadaac256426aefaa3ad69ece9fc90495aca6fe21b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d2f787cbf339760d08ba6dadaac256426aefaa3ad69ece9fc90495aca6fe21b","first_computed_at":"2026-07-05T10:30:45.504245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:30:45.504245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jis5UISsJhHRuok+ElmfI/d6iJo471p5YoJeah0djI/MOqVR/qz05Bh6QGthJ6gw/APi/CNanaMtQUjarnMzAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:30:45.504808Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.10447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:596c51b1f26272ebee40f968aefb5f4f0d027758c93d2476da050e4cdd775354","sha256:5c731e550c04dec75f8cc01d65122dc42c17015dea98ad9813c759360b068865"],"state_sha256":"f629375ee2a629de8108ba9c0c7b6f1657612085465ee9bc05fc00d409125cea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jn2n8gc3WC8YzzcFhKL7C09xk/0V9w7yfqeAwQ9O/CLZkH6Zywl4FKiRpHinWawl0macycwBan1L7/bj73J4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T05:48:31.540696Z","bundle_sha256":"3e52fe5adf68b98deac428b0a875eab8a38398038094b52cf6ad449702b96280"}}