{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LI6KRALWED37RTSYHZ5FZWXRIH","short_pith_number":"pith:LI6KRALW","canonical_record":{"source":{"id":"1603.04597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T09:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"f8d70c02b9f2b4a108c8b1ac6cc029330a69075221d9e184e2f2b37ea951bbb7","abstract_canon_sha256":"1f554ad7ad40f33df778ffa6264cb9353105ee5ec2ad51b1ea082362d91895b4"},"schema_version":"1.0"},"canonical_sha256":"5a3ca8817620f7f8ce583e7a5cdaf141e75d2bd4ef51d6d970b4905d6f0b513a","source":{"kind":"arxiv","id":"1603.04597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04597","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04597v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04597","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"LI6KRALWED37","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LI6KRALWED37RTSY","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LI6KRALW","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LI6KRALWED37RTSYHZ5FZWXRIH","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T09:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"f8d70c02b9f2b4a108c8b1ac6cc029330a69075221d9e184e2f2b37ea951bbb7","abstract_canon_sha256":"1f554ad7ad40f33df778ffa6264cb9353105ee5ec2ad51b1ea082362d91895b4"},"schema_version":"1.0"},"canonical_sha256":"5a3ca8817620f7f8ce583e7a5cdaf141e75d2bd4ef51d6d970b4905d6f0b513a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:04.405616Z","signature_b64":"iDNioMvCW23X1JIe7sGCOGMPIyoPXUTOWIvf2FeNlQAqkxMmu4+1APTw6I+3H7ZFz9difyDU+9JDrSdrwHrZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a3ca8817620f7f8ce583e7a5cdaf141e75d2bd4ef51d6d970b4905d6f0b513a","last_reissued_at":"2026-05-18T01:19:04.405029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:04.405029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04597","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18sm/m376Yo5oWCBwdkXoj4AYvCJj3sGgHISY3Fkbg8K9aYfRzr2wFJxDy0vLRY9UQv1q/UdIk3b4xLj1dvvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:09:41.410011Z"},"content_sha256":"7a80862c19cad3e6fe3ad91164529cd35ba9898c40fde894fca032e4fe5bcf13","schema_version":"1.0","event_id":"sha256:7a80862c19cad3e6fe3ad91164529cd35ba9898c40fde894fca032e4fe5bcf13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LI6KRALWED37RTSYHZ5FZWXRIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A branch and bound algorithm for a fractional 0-1 programming problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ekaterina Batsyna, Irina Utkina, Mikhail Batsyn","submitted_at":"2016-03-15T09:06:38Z","abstract_excerpt":"We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is maximized and inter-cell movement is minimized. This problem is called Cell Formation Problem (CFP) and it is an NP-hard optimization problem with Boolean variables and constraints and with a fractional objective function. Because of its high computational complexity there are a lot of heuristics developed for it. In this paper we suggest a branch and bound alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04597","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+JsmCO/wcRGOZEnupIh4SDOwl4uIz+4Mg1yZszEgPXwKd7hhxhgVHKBDqVavvPRr0goVDhTcQGmyF2MEUyZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:09:41.410371Z"},"content_sha256":"589b9029a810db59f431156b1d29f52a95870b3b7a3adc3af578fd970b084db2","schema_version":"1.0","event_id":"sha256:589b9029a810db59f431156b1d29f52a95870b3b7a3adc3af578fd970b084db2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LI6KRALWED37RTSYHZ5FZWXRIH/bundle.json","state_url":"https://pith.science/pith/LI6KRALWED37RTSYHZ5FZWXRIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LI6KRALWED37RTSYHZ5FZWXRIH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T10:09:41Z","links":{"resolver":"https://pith.science/pith/LI6KRALWED37RTSYHZ5FZWXRIH","bundle":"https://pith.science/pith/LI6KRALWED37RTSYHZ5FZWXRIH/bundle.json","state":"https://pith.science/pith/LI6KRALWED37RTSYHZ5FZWXRIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LI6KRALWED37RTSYHZ5FZWXRIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LI6KRALWED37RTSYHZ5FZWXRIH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1f554ad7ad40f33df778ffa6264cb9353105ee5ec2ad51b1ea082362d91895b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T09:06:38Z","title_canon_sha256":"f8d70c02b9f2b4a108c8b1ac6cc029330a69075221d9e184e2f2b37ea951bbb7"},"schema_version":"1.0","source":{"id":"1603.04597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04597","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04597v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04597","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"LI6KRALWED37","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LI6KRALWED37RTSY","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LI6KRALW","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:589b9029a810db59f431156b1d29f52a95870b3b7a3adc3af578fd970b084db2","target":"graph","created_at":"2026-05-18T01:19:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is maximized and inter-cell movement is minimized. This problem is called Cell Formation Problem (CFP) and it is an NP-hard optimization problem with Boolean variables and constraints and with a fractional objective function. Because of its high computational complexity there are a lot of heuristics developed for it. In this paper we suggest a branch and bound alg","authors_text":"Ekaterina Batsyna, Irina Utkina, Mikhail Batsyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T09:06:38Z","title":"A branch and bound algorithm for a fractional 0-1 programming problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04597","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7a80862c19cad3e6fe3ad91164529cd35ba9898c40fde894fca032e4fe5bcf13","target":"record","created_at":"2026-05-18T01:19:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1f554ad7ad40f33df778ffa6264cb9353105ee5ec2ad51b1ea082362d91895b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T09:06:38Z","title_canon_sha256":"f8d70c02b9f2b4a108c8b1ac6cc029330a69075221d9e184e2f2b37ea951bbb7"},"schema_version":"1.0","source":{"id":"1603.04597","kind":"arxiv","version":1}},"canonical_sha256":"5a3ca8817620f7f8ce583e7a5cdaf141e75d2bd4ef51d6d970b4905d6f0b513a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a3ca8817620f7f8ce583e7a5cdaf141e75d2bd4ef51d6d970b4905d6f0b513a","first_computed_at":"2026-05-18T01:19:04.405029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:04.405029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iDNioMvCW23X1JIe7sGCOGMPIyoPXUTOWIvf2FeNlQAqkxMmu4+1APTw6I+3H7ZFz9difyDU+9JDrSdrwHrZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:04.405616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a80862c19cad3e6fe3ad91164529cd35ba9898c40fde894fca032e4fe5bcf13","sha256:589b9029a810db59f431156b1d29f52a95870b3b7a3adc3af578fd970b084db2"],"state_sha256":"ce34709bf697269ec84f4c182be5a3c41c6e928b2555fdc5d7c4df60cece6b42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRJPJl5R9TClzYt4w5xYpVaKOzim1Tzpe6tNYmEjyoM7cME6WraNbSluPOJPsptyBdyQISxfSJHEKEzHe4VgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:09:41.412532Z","bundle_sha256":"543ff3bc80108c1d55869195ff5ea8aefd6c08443a3189337e18695b272afc7b"}}