{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DEMCNU6NLZBJL6WRTPD7A55SP5","short_pith_number":"pith:DEMCNU6N","schema_version":"1.0","canonical_sha256":"191826d3cd5e4295fad19bc7f077b27f5fc94ec32d8926746a2803dfd34e9dc6","source":{"kind":"arxiv","id":"1108.2701","version":2},"attestation_state":"computed","paper":{"title":"Maximizing Boosted Top Identification by Minimizing N-subjettiness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ex","physics.data-an"],"primary_cat":"hep-ph","authors_text":"Jesse Thaler, Ken Van Tilburg","submitted_at":"2011-08-12T20:00:04Z","abstract_excerpt":"N-subjettiness is a jet shape designed to identify boosted hadronic objects such as top quarks. Given N subjet axes within a jet, N-subjettiness sums the angular distances of jet constituents to their nearest subjet axis. Here, we generalize and improve on N-subjettiness by minimizing over all possible subjet directions, using a new variant of the k-means clustering algorithm. On boosted top benchmark samples from the BOOST2010 workshop, we demonstrate that a simple cut on the 3-subjettiness to 2-subjettiness ratio yields 20% (50%) tagging efficiency for a 0.23% (4.1%) fake rate, making N-subj"},"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":"1108.2701","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-ph","submitted_at":"2011-08-12T20:00:04Z","cross_cats_sorted":["hep-ex","physics.data-an"],"title_canon_sha256":"61bbf1e9e9d1117d2663ba01e7fe148cb4fc6d7ebcbd14179f1e6dd91254de5e","abstract_canon_sha256":"dca1c1ce7ababa1ed6f3838056b2d8e94fbcc1d0028f5550e87f02cd7c61bde0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:54.518545Z","signature_b64":"Y5rna+BDCLdfDnsotplEVHzV4MYvedHM+vJbolbRpkjy0H+Q+9q2qCXFuiPsANANsBz4egktcxzqYA4hLNVZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"191826d3cd5e4295fad19bc7f077b27f5fc94ec32d8926746a2803dfd34e9dc6","last_reissued_at":"2026-05-18T02:00:54.517705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:54.517705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Boosted Top Identification by Minimizing N-subjettiness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ex","physics.data-an"],"primary_cat":"hep-ph","authors_text":"Jesse Thaler, Ken Van Tilburg","submitted_at":"2011-08-12T20:00:04Z","abstract_excerpt":"N-subjettiness is a jet shape designed to identify boosted hadronic objects such as top quarks. Given N subjet axes within a jet, N-subjettiness sums the angular distances of jet constituents to their nearest subjet axis. Here, we generalize and improve on N-subjettiness by minimizing over all possible subjet directions, using a new variant of the k-means clustering algorithm. On boosted top benchmark samples from the BOOST2010 workshop, we demonstrate that a simple cut on the 3-subjettiness to 2-subjettiness ratio yields 20% (50%) tagging efficiency for a 0.23% (4.1%) fake rate, making N-subj"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2701","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":""},"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":"1108.2701","created_at":"2026-05-18T02:00:54.517867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2701v2","created_at":"2026-05-18T02:00:54.517867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2701","created_at":"2026-05-18T02:00:54.517867+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEMCNU6NLZBJ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEMCNU6NLZBJL6WR","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEMCNU6N","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25885","citing_title":"Explainable AI for Jet Tagging: A Comparative Study of GNNExplainer, GNNShap, and GradCAM for Jet Tagging in the Lund Jet Plane","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20965","citing_title":"Kitchen Sink Anomaly Detection","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"1901.10342","citing_title":"Looking inside jets: an introduction to jet substructure and boosted-object phenomenology","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5","json":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5.json","graph_json":"https://pith.science/api/pith-number/DEMCNU6NLZBJL6WRTPD7A55SP5/graph.json","events_json":"https://pith.science/api/pith-number/DEMCNU6NLZBJL6WRTPD7A55SP5/events.json","paper":"https://pith.science/paper/DEMCNU6N"},"agent_actions":{"view_html":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5","download_json":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5.json","view_paper":"https://pith.science/paper/DEMCNU6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2701&json=true","fetch_graph":"https://pith.science/api/pith-number/DEMCNU6NLZBJL6WRTPD7A55SP5/graph.json","fetch_events":"https://pith.science/api/pith-number/DEMCNU6NLZBJL6WRTPD7A55SP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5/action/storage_attestation","attest_author":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5/action/author_attestation","sign_citation":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5/action/citation_signature","submit_replication":"https://pith.science/pith/DEMCNU6NLZBJL6WRTPD7A55SP5/action/replication_record"}},"created_at":"2026-05-18T02:00:54.517867+00:00","updated_at":"2026-05-18T02:00:54.517867+00:00"}