{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3UMMFPYV5MO5PTQADJYQMSKHWZ","short_pith_number":"pith:3UMMFPYV","schema_version":"1.0","canonical_sha256":"dd18c2bf15eb1dd7ce001a71064947b660afb9afb6f2fa4013aae4d5d1a045e7","source":{"kind":"arxiv","id":"2403.12317","version":1},"attestation_state":"computed","paper":{"title":"EffiPerception: an Efficient Framework for Various Perception Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jiawei Zhang, Simon Dr\\\"ager, Xinhao Xiang","submitted_at":"2024-03-18T23:22:37Z","abstract_excerpt":"The accuracy-speed-memory trade-off is always the priority to consider for several computer vision perception tasks.\n  Previous methods mainly focus on a single or small couple of these tasks, such as creating effective data augmentation, feature extractor, learning strategies, etc. These approaches, however, could be inherently task-specific: their proposed model's performance may depend on a specific perception task or a dataset.\n  Targeting to explore common learning patterns and increasing the module robustness, we propose the EffiPerception framework.\n  It could achieve great accuracy-spe"},"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":"2403.12317","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-03-18T23:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"4c512fdb4066fc4708e45d949036708c20d482ba785bd81d898bc924afc54caa","abstract_canon_sha256":"b49805d4aea839fce1301cf4220c0279273fa3dfeab12279944462efc0b65618"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:59.013069Z","signature_b64":"uthrxVrxpnqy9OcajugJkpI7ugZp0PNxlKzSUGYJYV8uDJxNjxSUMZ7i7f56utPkmFoEJXvV4rqJqfG2FI03Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd18c2bf15eb1dd7ce001a71064947b660afb9afb6f2fa4013aae4d5d1a045e7","last_reissued_at":"2026-07-05T07:57:59.012429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:59.012429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EffiPerception: an Efficient Framework for Various Perception Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jiawei Zhang, Simon Dr\\\"ager, Xinhao Xiang","submitted_at":"2024-03-18T23:22:37Z","abstract_excerpt":"The accuracy-speed-memory trade-off is always the priority to consider for several computer vision perception tasks.\n  Previous methods mainly focus on a single or small couple of these tasks, such as creating effective data augmentation, feature extractor, learning strategies, etc. These approaches, however, could be inherently task-specific: their proposed model's performance may depend on a specific perception task or a dataset.\n  Targeting to explore common learning patterns and increasing the module robustness, we propose the EffiPerception framework.\n  It could achieve great accuracy-spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12317","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/2403.12317/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":"2403.12317","created_at":"2026-07-05T07:57:59.012497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.12317v1","created_at":"2026-07-05T07:57:59.012497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12317","created_at":"2026-07-05T07:57:59.012497+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UMMFPYV5MO5","created_at":"2026-07-05T07:57:59.012497+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UMMFPYV5MO5PTQA","created_at":"2026-07-05T07:57:59.012497+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UMMFPYV","created_at":"2026-07-05T07:57:59.012497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.16812","citing_title":"Towards Open-Vocabulary Multimodal 3D Object Detection with Attributes","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ","json":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ.json","graph_json":"https://pith.science/api/pith-number/3UMMFPYV5MO5PTQADJYQMSKHWZ/graph.json","events_json":"https://pith.science/api/pith-number/3UMMFPYV5MO5PTQADJYQMSKHWZ/events.json","paper":"https://pith.science/paper/3UMMFPYV"},"agent_actions":{"view_html":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ","download_json":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ.json","view_paper":"https://pith.science/paper/3UMMFPYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.12317&json=true","fetch_graph":"https://pith.science/api/pith-number/3UMMFPYV5MO5PTQADJYQMSKHWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3UMMFPYV5MO5PTQADJYQMSKHWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ/action/storage_attestation","attest_author":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ/action/author_attestation","sign_citation":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ/action/citation_signature","submit_replication":"https://pith.science/pith/3UMMFPYV5MO5PTQADJYQMSKHWZ/action/replication_record"}},"created_at":"2026-07-05T07:57:59.012497+00:00","updated_at":"2026-07-05T07:57:59.012497+00:00"}