{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IPQ3JYTXQC7EZ6LVMYB27SBOWT","short_pith_number":"pith:IPQ3JYTX","schema_version":"1.0","canonical_sha256":"43e1b4e27780be4cf9756603afc82eb4d8e5b6dbcdc6cd9472340e8d6ecc87a3","source":{"kind":"arxiv","id":"1808.00297","version":1},"attestation_state":"computed","paper":{"title":"TraMNet - Transition Matrix Network for Efficient Action Tube Proposals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.RO"],"primary_cat":"eess.IV","authors_text":"Fabio Cuzzolin, Gurkirt Singh, Suman Saha","submitted_at":"2018-08-01T12:33:57Z","abstract_excerpt":"Current state-of-the-art methods solve spatiotemporal action localisation by extending 2D anchors to 3D-cuboid proposals on stacks of frames, to generate sets of temporally connected bounding boxes called \\textit{action micro-tubes}. However, they fail to consider that the underlying anchor proposal hypotheses should also move (transition) from frame to frame, as the actor or the camera does. Assuming we evaluate $n$ 2D anchors in each frame, then the number of possible transitions from each 2D anchor to the next, for a sequence of $f$ consecutive frames, is in the order of $O(n^f)$, expensive"},"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":"1808.00297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-08-01T12:33:57Z","cross_cats_sorted":["cs.CV","cs.RO"],"title_canon_sha256":"eab3eaac56eb60c01b65e942dcaede456023330224aa305564494bebba38dff6","abstract_canon_sha256":"1d218b997c2c90697f66b74642980343bb7a72b8b423df1fa9079cbe653f6eed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:06.557490Z","signature_b64":"mro78Np0GuunGzckjRzp0lrR9ynFs8pZdHt/HRw5dS1Mj/gVklQ4kXW9DkXU/kvQOPL/FJqvEBA1CeV+DuYTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43e1b4e27780be4cf9756603afc82eb4d8e5b6dbcdc6cd9472340e8d6ecc87a3","last_reissued_at":"2026-05-18T00:09:06.556857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:06.556857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TraMNet - Transition Matrix Network for Efficient Action Tube Proposals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.RO"],"primary_cat":"eess.IV","authors_text":"Fabio Cuzzolin, Gurkirt Singh, Suman Saha","submitted_at":"2018-08-01T12:33:57Z","abstract_excerpt":"Current state-of-the-art methods solve spatiotemporal action localisation by extending 2D anchors to 3D-cuboid proposals on stacks of frames, to generate sets of temporally connected bounding boxes called \\textit{action micro-tubes}. However, they fail to consider that the underlying anchor proposal hypotheses should also move (transition) from frame to frame, as the actor or the camera does. Assuming we evaluate $n$ 2D anchors in each frame, then the number of possible transitions from each 2D anchor to the next, for a sequence of $f$ consecutive frames, is in the order of $O(n^f)$, expensive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00297","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":""},"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":"1808.00297","created_at":"2026-05-18T00:09:06.556980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00297v1","created_at":"2026-05-18T00:09:06.556980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00297","created_at":"2026-05-18T00:09:06.556980+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPQ3JYTXQC7E","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPQ3JYTXQC7EZ6LV","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPQ3JYTX","created_at":"2026-05-18T12:32:31.084164+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/IPQ3JYTXQC7EZ6LVMYB27SBOWT","json":"https://pith.science/pith/IPQ3JYTXQC7EZ6LVMYB27SBOWT.json","graph_json":"https://pith.science/api/pith-number/IPQ3JYTXQC7EZ6LVMYB27SBOWT/graph.json","events_json":"https://pith.science/api/pith-number/IPQ3JYTXQC7EZ6LVMYB27SBOWT/events.json","paper":"https://pith.science/paper/IPQ3JYTX"},"agent_actions":{"view_html":"https://pith.science/pith/IPQ3JYTXQC7EZ6LVMYB27SBOWT","download_json":"https://pith.science/pith/IPQ3JYTXQC7EZ6LVMYB27SBOWT.json","view_paper":"https://pith.science/paper/IPQ3JYTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00297&json=true","fetch_graph":"https://pith.science/api/pith-number/IPQ3JYTXQC7EZ6LVMYB27SBOWT/graph.json","fetch_events":"https://pith.science/api/pith-number/IPQ3JYTXQC7EZ6LVMYB27SBOWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPQ3JYTXQC7EZ6LVMYB27SBOWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPQ3JYTXQC7EZ6LVMYB27SBOWT/action/storage_attestation","attest_author":"https://pith.science/pith/IPQ3JYTXQC7EZ6LVMYB27SBOWT/action/author_attestation","sign_citation":"https://pith.science/pith/IPQ3JYTXQC7EZ6LVMYB27SBOWT/action/citation_signature","submit_replication":"https://pith.science/pith/IPQ3JYTXQC7EZ6LVMYB27SBOWT/action/replication_record"}},"created_at":"2026-05-18T00:09:06.556980+00:00","updated_at":"2026-05-18T00:09:06.556980+00:00"}