{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UC4KXUZQW6OES5LJKUABOXK3H3","short_pith_number":"pith:UC4KXUZQ","schema_version":"1.0","canonical_sha256":"a0b8abd330b79c4975695500175d5b3ecc21fd1a4a1443b1c8db4880a9b3326b","source":{"kind":"arxiv","id":"1301.4895","version":2},"attestation_state":"computed","paper":{"title":"A recursive approach to determine correlation functions in multi-baryon systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-lat","authors_text":"B\\'alint C. T\\'oth, Jana G\\\"unther, Lukas Varnhorst","submitted_at":"2013-01-21T15:44:01Z","abstract_excerpt":"We propose a recursive algorithm for the calculation of multi-baryon correlation functions that combines the advantages of a recursive approach with those of the recently proposed unified contraction algorithm. The independent components of the correlators are built recursively by adding the baryons one after the other in a given order. The list of nonzero independent components is also constructed in a recursive manner, significantly reducing the resources required for this step. We computed the number of operations required to calculate the correlators up to Be^8, and observed a significant "},"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":"1301.4895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-lat","submitted_at":"2013-01-21T15:44:01Z","cross_cats_sorted":[],"title_canon_sha256":"461f993c1df9da8f44d58921572566b780e6308afa9e5bc5c9119687b8700bd1","abstract_canon_sha256":"b89c33771af3e325ffb178759a6b3d11c97ef93cc5fd4a901187dd27cd0821c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:18.537537Z","signature_b64":"UXaki3hLqEggQ7k/DW/BSgah/bP4e3n56R0NBrpvRP+rK81zUqTT0HOB0IKw0lFz9wOdu+84EoThior41hI0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0b8abd330b79c4975695500175d5b3ecc21fd1a4a1443b1c8db4880a9b3326b","last_reissued_at":"2026-05-18T03:22:18.536619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:18.536619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A recursive approach to determine correlation functions in multi-baryon systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"hep-lat","authors_text":"B\\'alint C. T\\'oth, Jana G\\\"unther, Lukas Varnhorst","submitted_at":"2013-01-21T15:44:01Z","abstract_excerpt":"We propose a recursive algorithm for the calculation of multi-baryon correlation functions that combines the advantages of a recursive approach with those of the recently proposed unified contraction algorithm. The independent components of the correlators are built recursively by adding the baryons one after the other in a given order. The list of nonzero independent components is also constructed in a recursive manner, significantly reducing the resources required for this step. We computed the number of operations required to calculate the correlators up to Be^8, and observed a significant "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4895","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":"1301.4895","created_at":"2026-05-18T03:22:18.536725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4895v2","created_at":"2026-05-18T03:22:18.536725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4895","created_at":"2026-05-18T03:22:18.536725+00:00"},{"alias_kind":"pith_short_12","alias_value":"UC4KXUZQW6OE","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UC4KXUZQW6OES5LJ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UC4KXUZQ","created_at":"2026-05-18T12:28:02.375192+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/UC4KXUZQW6OES5LJKUABOXK3H3","json":"https://pith.science/pith/UC4KXUZQW6OES5LJKUABOXK3H3.json","graph_json":"https://pith.science/api/pith-number/UC4KXUZQW6OES5LJKUABOXK3H3/graph.json","events_json":"https://pith.science/api/pith-number/UC4KXUZQW6OES5LJKUABOXK3H3/events.json","paper":"https://pith.science/paper/UC4KXUZQ"},"agent_actions":{"view_html":"https://pith.science/pith/UC4KXUZQW6OES5LJKUABOXK3H3","download_json":"https://pith.science/pith/UC4KXUZQW6OES5LJKUABOXK3H3.json","view_paper":"https://pith.science/paper/UC4KXUZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4895&json=true","fetch_graph":"https://pith.science/api/pith-number/UC4KXUZQW6OES5LJKUABOXK3H3/graph.json","fetch_events":"https://pith.science/api/pith-number/UC4KXUZQW6OES5LJKUABOXK3H3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UC4KXUZQW6OES5LJKUABOXK3H3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UC4KXUZQW6OES5LJKUABOXK3H3/action/storage_attestation","attest_author":"https://pith.science/pith/UC4KXUZQW6OES5LJKUABOXK3H3/action/author_attestation","sign_citation":"https://pith.science/pith/UC4KXUZQW6OES5LJKUABOXK3H3/action/citation_signature","submit_replication":"https://pith.science/pith/UC4KXUZQW6OES5LJKUABOXK3H3/action/replication_record"}},"created_at":"2026-05-18T03:22:18.536725+00:00","updated_at":"2026-05-18T03:22:18.536725+00:00"}