{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4Y5N6CORIRZ3CNSGLO53WVMBGM","short_pith_number":"pith:4Y5N6COR","schema_version":"1.0","canonical_sha256":"e63adf09d14473b136465bbbbb5581332d87caa3f9cb9bcf1f883bc06617c224","source":{"kind":"arxiv","id":"2302.02693","version":2},"attestation_state":"computed","paper":{"title":"PatchDCT: Patch Refinement for High Quality Instance Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jirui Yang, Kewei Liang, Qinrou Wen, Xue Yang","submitted_at":"2023-02-06T10:51:21Z","abstract_excerpt":"High-quality instance segmentation has shown emerging importance in computer vision. Without any refinement, DCT-Mask directly generates high-resolution masks by compressed vectors. To further refine masks obtained by compressed vectors, we propose for the first time a compressed vector based multi-stage refinement framework. However, the vanilla combination does not bring significant gains, because changes in some elements of the DCT vector will affect the prediction of the entire mask. Thus, we propose a simple and novel method named PatchDCT, which separates the mask decoded from a DCT vect"},"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":"2302.02693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-02-06T10:51:21Z","cross_cats_sorted":[],"title_canon_sha256":"73b24995d637ef9227cb1f849036849d2022db90f4c2679091961a9370f0ac95","abstract_canon_sha256":"0e54841b284e6174f3c1576edbb8c5c9f6e035f28765141d700af147b33b18e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:33.174946Z","signature_b64":"1CyO9rfF8MTMuk0cknHNrPMQgBoiHLWi5TTMKH/n+Pfv2VZrE/eN3+JrvOSqL7bmok//r5QUyKak2AHTuQ4hDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e63adf09d14473b136465bbbbb5581332d87caa3f9cb9bcf1f883bc06617c224","last_reissued_at":"2026-07-05T05:39:33.174574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:33.174574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PatchDCT: Patch Refinement for High Quality Instance Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jirui Yang, Kewei Liang, Qinrou Wen, Xue Yang","submitted_at":"2023-02-06T10:51:21Z","abstract_excerpt":"High-quality instance segmentation has shown emerging importance in computer vision. Without any refinement, DCT-Mask directly generates high-resolution masks by compressed vectors. To further refine masks obtained by compressed vectors, we propose for the first time a compressed vector based multi-stage refinement framework. However, the vanilla combination does not bring significant gains, because changes in some elements of the DCT vector will affect the prediction of the entire mask. Thus, we propose a simple and novel method named PatchDCT, which separates the mask decoded from a DCT vect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02693","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/2302.02693/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":"2302.02693","created_at":"2026-07-05T05:39:33.174628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.02693v2","created_at":"2026-07-05T05:39:33.174628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02693","created_at":"2026-07-05T05:39:33.174628+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Y5N6CORIRZ3","created_at":"2026-07-05T05:39:33.174628+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Y5N6CORIRZ3CNSG","created_at":"2026-07-05T05:39:33.174628+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Y5N6COR","created_at":"2026-07-05T05:39:33.174628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.00430","citing_title":"MFH: Marrying Frequency Domain with Handwritten Mathematical Expression Recognition","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM","json":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM.json","graph_json":"https://pith.science/api/pith-number/4Y5N6CORIRZ3CNSGLO53WVMBGM/graph.json","events_json":"https://pith.science/api/pith-number/4Y5N6CORIRZ3CNSGLO53WVMBGM/events.json","paper":"https://pith.science/paper/4Y5N6COR"},"agent_actions":{"view_html":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM","download_json":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM.json","view_paper":"https://pith.science/paper/4Y5N6COR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.02693&json=true","fetch_graph":"https://pith.science/api/pith-number/4Y5N6CORIRZ3CNSGLO53WVMBGM/graph.json","fetch_events":"https://pith.science/api/pith-number/4Y5N6CORIRZ3CNSGLO53WVMBGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM/action/storage_attestation","attest_author":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM/action/author_attestation","sign_citation":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM/action/citation_signature","submit_replication":"https://pith.science/pith/4Y5N6CORIRZ3CNSGLO53WVMBGM/action/replication_record"}},"created_at":"2026-07-05T05:39:33.174628+00:00","updated_at":"2026-07-05T05:39:33.174628+00:00"}